./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66bd96ca17eda037d6b50686600c4452437b4688 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:11:33,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:33,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:33,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:33,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:33,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:33,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:33,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:33,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:33,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:33,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:33,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:33,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:33,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:33,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:33,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:33,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:33,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:33,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:33,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:33,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:33,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:33,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:33,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:33,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:33,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:33,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:33,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:33,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:33,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:33,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:33,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:33,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:33,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:33,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:33,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:33,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:33,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:33,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:33,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:33,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:33,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:11:33,775 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:33,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:33,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:33,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:33,777 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:33,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:33,778 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:33,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:33,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:33,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:33,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:33,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:33,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:33,780 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:33,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:33,780 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:33,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:33,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:33,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:33,782 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:33,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:33,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:33,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:33,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:33,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:33,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:33,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:33,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:33,784 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:33,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66bd96ca17eda037d6b50686600c4452437b4688 [2019-11-28 18:11:34,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:34,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:34,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:34,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:34,122 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:34,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i [2019-11-28 18:11:34,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c5f5815/220babeb4f2d4addb0757eb40e4471dd/FLAGb1a748226 [2019-11-28 18:11:34,675 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:34,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i [2019-11-28 18:11:34,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c5f5815/220babeb4f2d4addb0757eb40e4471dd/FLAGb1a748226 [2019-11-28 18:11:35,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c5f5815/220babeb4f2d4addb0757eb40e4471dd [2019-11-28 18:11:35,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:35,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:35,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:35,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:35,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:35,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5169a7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35, skipping insertion in model container [2019-11-28 18:11:35,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:35,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:35,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:35,700 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:35,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:35,869 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:35,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35 WrapperNode [2019-11-28 18:11:35,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:35,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:35,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:35,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:35,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:35,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:35,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:35,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:35,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... [2019-11-28 18:11:35,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:35,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:35,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:35,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:35,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:36,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:36,059 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:11:36,748 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:11:36,749 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:11:36,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:36 BoogieIcfgContainer [2019-11-28 18:11:36,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:11:36,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:11:36,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:11:36,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:11:36,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:35" (1/3) ... [2019-11-28 18:11:36,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249d7097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:36, skipping insertion in model container [2019-11-28 18:11:36,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:35" (2/3) ... [2019-11-28 18:11:36,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249d7097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:36, skipping insertion in model container [2019-11-28 18:11:36,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:36" (3/3) ... [2019-11-28 18:11:36,759 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.opt.i [2019-11-28 18:11:36,770 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:11:36,770 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:11:36,778 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:11:36,780 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:11:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,821 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,822 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:36,882 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:11:36,904 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:11:36,905 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:11:36,905 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:11:36,905 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:11:36,905 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:11:36,906 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:11:36,906 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:11:36,906 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:11:36,923 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-11-28 18:11:36,926 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-11-28 18:11:37,004 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-11-28 18:11:37,005 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:37,019 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:11:37,042 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-11-28 18:11:37,112 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-11-28 18:11:37,113 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:37,125 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:11:37,149 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:11:37,151 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:11:41,750 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 18:11:42,067 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-11-28 18:11:42,182 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 18:11:42,333 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-28 18:11:42,462 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:11:42,500 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-11-28 18:11:42,500 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-11-28 18:11:42,504 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-11-28 18:11:42,936 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-11-28 18:11:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-11-28 18:11:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:11:42,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:42,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:11:42,950 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-11-28 18:11:42,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:42,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532233320] [2019-11-28 18:11:42,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:43,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532233320] [2019-11-28 18:11:43,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:43,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:43,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934134580] [2019-11-28 18:11:43,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:43,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:43,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:43,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:43,317 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-11-28 18:11:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:43,619 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-11-28 18:11:43,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:43,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:11:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:43,699 INFO L225 Difference]: With dead ends: 6414 [2019-11-28 18:11:43,699 INFO L226 Difference]: Without dead ends: 6042 [2019-11-28 18:11:43,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-11-28 18:11:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-11-28 18:11:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-11-28 18:11:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-11-28 18:11:44,077 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-11-28 18:11:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:44,078 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-11-28 18:11:44,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-11-28 18:11:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:11:44,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:44,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:44,084 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-11-28 18:11:44,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:44,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600634387] [2019-11-28 18:11:44,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:44,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600634387] [2019-11-28 18:11:44,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:44,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:44,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763995746] [2019-11-28 18:11:44,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:44,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:44,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:44,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:44,253 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 4 states. [2019-11-28 18:11:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:44,582 INFO L93 Difference]: Finished difference Result 9128 states and 29363 transitions. [2019-11-28 18:11:44,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:44,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:11:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:44,656 INFO L225 Difference]: With dead ends: 9128 [2019-11-28 18:11:44,657 INFO L226 Difference]: Without dead ends: 9113 [2019-11-28 18:11:44,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2019-11-28 18:11:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 8369. [2019-11-28 18:11:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-11-28 18:11:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 27318 transitions. [2019-11-28 18:11:45,177 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 27318 transitions. Word has length 11 [2019-11-28 18:11:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:45,178 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 27318 transitions. [2019-11-28 18:11:45,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 27318 transitions. [2019-11-28 18:11:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:45,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:45,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:45,185 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:45,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-11-28 18:11:45,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:45,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070895160] [2019-11-28 18:11:45,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:45,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070895160] [2019-11-28 18:11:45,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:45,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:45,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100176904] [2019-11-28 18:11:45,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:45,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:45,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:45,263 INFO L87 Difference]: Start difference. First operand 8369 states and 27318 transitions. Second operand 3 states. [2019-11-28 18:11:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:45,408 INFO L93 Difference]: Finished difference Result 11252 states and 36788 transitions. [2019-11-28 18:11:45,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:45,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:11:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:45,468 INFO L225 Difference]: With dead ends: 11252 [2019-11-28 18:11:45,469 INFO L226 Difference]: Without dead ends: 11252 [2019-11-28 18:11:45,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11252 states. [2019-11-28 18:11:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11252 to 9819. [2019-11-28 18:11:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-11-28 18:11:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32327 transitions. [2019-11-28 18:11:45,793 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32327 transitions. Word has length 14 [2019-11-28 18:11:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:45,795 INFO L462 AbstractCegarLoop]: Abstraction has 9819 states and 32327 transitions. [2019-11-28 18:11:45,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32327 transitions. [2019-11-28 18:11:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:45,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:45,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:45,798 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:45,799 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-11-28 18:11:45,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:45,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151994274] [2019-11-28 18:11:45,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:45,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151994274] [2019-11-28 18:11:45,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:45,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:45,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119833055] [2019-11-28 18:11:45,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:45,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:45,872 INFO L87 Difference]: Start difference. First operand 9819 states and 32327 transitions. Second operand 4 states. [2019-11-28 18:11:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:46,120 INFO L93 Difference]: Finished difference Result 11915 states and 38297 transitions. [2019-11-28 18:11:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:46,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:46,166 INFO L225 Difference]: With dead ends: 11915 [2019-11-28 18:11:46,166 INFO L226 Difference]: Without dead ends: 11904 [2019-11-28 18:11:46,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11904 states. [2019-11-28 18:11:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11904 to 10744. [2019-11-28 18:11:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-11-28 18:11:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 35020 transitions. [2019-11-28 18:11:46,555 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 35020 transitions. Word has length 14 [2019-11-28 18:11:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:46,556 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 35020 transitions. [2019-11-28 18:11:46,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 35020 transitions. [2019-11-28 18:11:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:46,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:46,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:46,559 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-11-28 18:11:46,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:46,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684924759] [2019-11-28 18:11:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:46,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684924759] [2019-11-28 18:11:46,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:46,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:46,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201411334] [2019-11-28 18:11:46,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:46,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:46,612 INFO L87 Difference]: Start difference. First operand 10744 states and 35020 transitions. Second operand 4 states. [2019-11-28 18:11:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:46,809 INFO L93 Difference]: Finished difference Result 12870 states and 41385 transitions. [2019-11-28 18:11:46,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:46,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:46,857 INFO L225 Difference]: With dead ends: 12870 [2019-11-28 18:11:46,857 INFO L226 Difference]: Without dead ends: 12857 [2019-11-28 18:11:46,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12857 states. [2019-11-28 18:11:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12857 to 10870. [2019-11-28 18:11:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10870 states. [2019-11-28 18:11:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10870 states to 10870 states and 35539 transitions. [2019-11-28 18:11:47,364 INFO L78 Accepts]: Start accepts. Automaton has 10870 states and 35539 transitions. Word has length 14 [2019-11-28 18:11:47,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:47,364 INFO L462 AbstractCegarLoop]: Abstraction has 10870 states and 35539 transitions. [2019-11-28 18:11:47,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 10870 states and 35539 transitions. [2019-11-28 18:11:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:11:47,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:47,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:47,370 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash -133127032, now seen corresponding path program 1 times [2019-11-28 18:11:47,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:47,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111763280] [2019-11-28 18:11:47,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:47,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111763280] [2019-11-28 18:11:47,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:47,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:47,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589398081] [2019-11-28 18:11:47,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:47,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:47,484 INFO L87 Difference]: Start difference. First operand 10870 states and 35539 transitions. Second operand 3 states. [2019-11-28 18:11:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:47,552 INFO L93 Difference]: Finished difference Result 10914 states and 35611 transitions. [2019-11-28 18:11:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:47,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:11:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:47,581 INFO L225 Difference]: With dead ends: 10914 [2019-11-28 18:11:47,582 INFO L226 Difference]: Without dead ends: 10914 [2019-11-28 18:11:47,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10914 states. [2019-11-28 18:11:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10914 to 10867. [2019-11-28 18:11:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10867 states. [2019-11-28 18:11:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 35530 transitions. [2019-11-28 18:11:47,881 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 35530 transitions. Word has length 16 [2019-11-28 18:11:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:47,882 INFO L462 AbstractCegarLoop]: Abstraction has 10867 states and 35530 transitions. [2019-11-28 18:11:47,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 35530 transitions. [2019-11-28 18:11:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:11:47,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:47,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:47,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1519842378, now seen corresponding path program 1 times [2019-11-28 18:11:47,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:47,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038461689] [2019-11-28 18:11:47,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:47,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038461689] [2019-11-28 18:11:47,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:47,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:47,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720092664] [2019-11-28 18:11:47,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:47,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:47,957 INFO L87 Difference]: Start difference. First operand 10867 states and 35530 transitions. Second operand 4 states. [2019-11-28 18:11:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:48,020 INFO L93 Difference]: Finished difference Result 10731 states and 35082 transitions. [2019-11-28 18:11:48,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:48,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:11:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:48,038 INFO L225 Difference]: With dead ends: 10731 [2019-11-28 18:11:48,038 INFO L226 Difference]: Without dead ends: 10731 [2019-11-28 18:11:48,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10731 states. [2019-11-28 18:11:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10731 to 10731. [2019-11-28 18:11:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10731 states. [2019-11-28 18:11:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10731 states to 10731 states and 35082 transitions. [2019-11-28 18:11:48,355 INFO L78 Accepts]: Start accepts. Automaton has 10731 states and 35082 transitions. Word has length 17 [2019-11-28 18:11:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:48,356 INFO L462 AbstractCegarLoop]: Abstraction has 10731 states and 35082 transitions. [2019-11-28 18:11:48,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10731 states and 35082 transitions. [2019-11-28 18:11:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:11:48,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:48,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:48,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash 319851597, now seen corresponding path program 1 times [2019-11-28 18:11:48,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:48,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288252545] [2019-11-28 18:11:48,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:48,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288252545] [2019-11-28 18:11:48,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:48,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:48,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806789787] [2019-11-28 18:11:48,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:48,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:48,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:48,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:48,421 INFO L87 Difference]: Start difference. First operand 10731 states and 35082 transitions. Second operand 3 states. [2019-11-28 18:11:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:48,504 INFO L93 Difference]: Finished difference Result 10169 states and 32732 transitions. [2019-11-28 18:11:48,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:48,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:11:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:48,530 INFO L225 Difference]: With dead ends: 10169 [2019-11-28 18:11:48,530 INFO L226 Difference]: Without dead ends: 10169 [2019-11-28 18:11:48,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10169 states. [2019-11-28 18:11:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10169 to 10069. [2019-11-28 18:11:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10069 states. [2019-11-28 18:11:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10069 states to 10069 states and 32442 transitions. [2019-11-28 18:11:48,834 INFO L78 Accepts]: Start accepts. Automaton has 10069 states and 32442 transitions. Word has length 17 [2019-11-28 18:11:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:48,834 INFO L462 AbstractCegarLoop]: Abstraction has 10069 states and 32442 transitions. [2019-11-28 18:11:48,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 10069 states and 32442 transitions. [2019-11-28 18:11:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:11:48,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:48,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:48,842 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:48,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:48,843 INFO L82 PathProgramCache]: Analyzing trace with hash 913825408, now seen corresponding path program 1 times [2019-11-28 18:11:48,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:48,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313845465] [2019-11-28 18:11:48,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:49,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313845465] [2019-11-28 18:11:49,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:49,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:49,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839093466] [2019-11-28 18:11:49,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:49,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:49,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:49,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:49,149 INFO L87 Difference]: Start difference. First operand 10069 states and 32442 transitions. Second operand 3 states. [2019-11-28 18:11:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:49,163 INFO L93 Difference]: Finished difference Result 1517 states and 3655 transitions. [2019-11-28 18:11:49,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:49,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:11:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:49,166 INFO L225 Difference]: With dead ends: 1517 [2019-11-28 18:11:49,166 INFO L226 Difference]: Without dead ends: 1517 [2019-11-28 18:11:49,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-11-28 18:11:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1517. [2019-11-28 18:11:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1517 states. [2019-11-28 18:11:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 3655 transitions. [2019-11-28 18:11:49,193 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 3655 transitions. Word has length 18 [2019-11-28 18:11:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:49,193 INFO L462 AbstractCegarLoop]: Abstraction has 1517 states and 3655 transitions. [2019-11-28 18:11:49,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 3655 transitions. [2019-11-28 18:11:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:11:49,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:49,196 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:49,196 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:49,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-11-28 18:11:49,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:49,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466762873] [2019-11-28 18:11:49,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:49,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466762873] [2019-11-28 18:11:49,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:49,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:49,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885607747] [2019-11-28 18:11:49,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:49,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:49,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:49,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:49,253 INFO L87 Difference]: Start difference. First operand 1517 states and 3655 transitions. Second operand 5 states. [2019-11-28 18:11:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:49,496 INFO L93 Difference]: Finished difference Result 2131 states and 5036 transitions. [2019-11-28 18:11:49,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:49,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:11:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:49,500 INFO L225 Difference]: With dead ends: 2131 [2019-11-28 18:11:49,501 INFO L226 Difference]: Without dead ends: 2129 [2019-11-28 18:11:49,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-11-28 18:11:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1681. [2019-11-28 18:11:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1681 states. [2019-11-28 18:11:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 4023 transitions. [2019-11-28 18:11:49,542 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 4023 transitions. Word has length 26 [2019-11-28 18:11:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:49,542 INFO L462 AbstractCegarLoop]: Abstraction has 1681 states and 4023 transitions. [2019-11-28 18:11:49,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 4023 transitions. [2019-11-28 18:11:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:11:49,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:49,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:49,546 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:49,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:49,547 INFO L82 PathProgramCache]: Analyzing trace with hash 225797087, now seen corresponding path program 1 times [2019-11-28 18:11:49,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:49,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022637628] [2019-11-28 18:11:49,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:49,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022637628] [2019-11-28 18:11:49,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:49,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:49,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364297982] [2019-11-28 18:11:49,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:49,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:49,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:49,592 INFO L87 Difference]: Start difference. First operand 1681 states and 4023 transitions. Second operand 4 states. [2019-11-28 18:11:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:49,612 INFO L93 Difference]: Finished difference Result 738 states and 1681 transitions. [2019-11-28 18:11:49,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:11:49,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:11:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:49,614 INFO L225 Difference]: With dead ends: 738 [2019-11-28 18:11:49,614 INFO L226 Difference]: Without dead ends: 738 [2019-11-28 18:11:49,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-11-28 18:11:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 669. [2019-11-28 18:11:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-11-28 18:11:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1547 transitions. [2019-11-28 18:11:49,627 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1547 transitions. Word has length 27 [2019-11-28 18:11:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:49,627 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 1547 transitions. [2019-11-28 18:11:49,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1547 transitions. [2019-11-28 18:11:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:49,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:49,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:49,631 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:49,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1722201146, now seen corresponding path program 1 times [2019-11-28 18:11:49,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:49,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377900151] [2019-11-28 18:11:49,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:49,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377900151] [2019-11-28 18:11:49,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:49,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:11:49,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052039270] [2019-11-28 18:11:49,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:49,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:49,744 INFO L87 Difference]: Start difference. First operand 669 states and 1547 transitions. Second operand 5 states. [2019-11-28 18:11:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:49,772 INFO L93 Difference]: Finished difference Result 1076 states and 2526 transitions. [2019-11-28 18:11:49,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:49,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 18:11:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:49,773 INFO L225 Difference]: With dead ends: 1076 [2019-11-28 18:11:49,774 INFO L226 Difference]: Without dead ends: 426 [2019-11-28 18:11:49,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:11:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-28 18:11:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-11-28 18:11:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-28 18:11:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1010 transitions. [2019-11-28 18:11:49,783 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1010 transitions. Word has length 42 [2019-11-28 18:11:49,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:49,783 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 1010 transitions. [2019-11-28 18:11:49,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1010 transitions. [2019-11-28 18:11:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:49,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:49,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:49,786 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash -146556572, now seen corresponding path program 2 times [2019-11-28 18:11:49,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:49,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626767176] [2019-11-28 18:11:49,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:50,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626767176] [2019-11-28 18:11:50,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:50,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:11:50,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722860785] [2019-11-28 18:11:50,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:11:50,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:11:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:11:50,129 INFO L87 Difference]: Start difference. First operand 426 states and 1010 transitions. Second operand 12 states. [2019-11-28 18:11:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:50,718 INFO L93 Difference]: Finished difference Result 876 states and 2013 transitions. [2019-11-28 18:11:50,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:11:50,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-11-28 18:11:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:50,720 INFO L225 Difference]: With dead ends: 876 [2019-11-28 18:11:50,721 INFO L226 Difference]: Without dead ends: 656 [2019-11-28 18:11:50,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-11-28 18:11:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-11-28 18:11:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 459. [2019-11-28 18:11:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-11-28 18:11:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1096 transitions. [2019-11-28 18:11:50,730 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1096 transitions. Word has length 42 [2019-11-28 18:11:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:50,731 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 1096 transitions. [2019-11-28 18:11:50,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:11:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1096 transitions. [2019-11-28 18:11:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:50,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:50,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:50,733 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:50,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:50,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1924563056, now seen corresponding path program 3 times [2019-11-28 18:11:50,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:50,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522819929] [2019-11-28 18:11:50,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:50,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522819929] [2019-11-28 18:11:50,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:50,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:50,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359956811] [2019-11-28 18:11:50,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:11:50,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:11:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:50,864 INFO L87 Difference]: Start difference. First operand 459 states and 1096 transitions. Second operand 7 states. [2019-11-28 18:11:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:51,049 INFO L93 Difference]: Finished difference Result 842 states and 1954 transitions. [2019-11-28 18:11:51,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:11:51,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-28 18:11:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:51,051 INFO L225 Difference]: With dead ends: 842 [2019-11-28 18:11:51,052 INFO L226 Difference]: Without dead ends: 540 [2019-11-28 18:11:51,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:11:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-28 18:11:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 474. [2019-11-28 18:11:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-11-28 18:11:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1092 transitions. [2019-11-28 18:11:51,062 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1092 transitions. Word has length 42 [2019-11-28 18:11:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:51,062 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 1092 transitions. [2019-11-28 18:11:51,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:11:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1092 transitions. [2019-11-28 18:11:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:51,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:51,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:51,064 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:51,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:51,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 4 times [2019-11-28 18:11:51,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:51,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49693586] [2019-11-28 18:11:51,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:51,184 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:11:51,184 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:11:51,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= |v_ULTIMATE.start_main_~#t843~0.offset_26| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t843~0.base_37| 4)) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37|) |v_ULTIMATE.start_main_~#t843~0.offset_26| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37|)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t843~0.base_37|) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37| 1)) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_main_~#t843~0.base=|v_ULTIMATE.start_main_~#t843~0.base_37|, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ULTIMATE.start_main_~#t843~0.offset=|v_ULTIMATE.start_main_~#t843~0.offset_26|, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t844~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t843~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t844~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t843~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:11:51,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t844~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t844~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t844~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12|) |v_ULTIMATE.start_main_~#t844~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t844~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t844~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t844~0.base] because there is no mapped edge [2019-11-28 18:11:51,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~__unbuffered_p1_EBX~0_Out824218788 ~a~0_In824218788) (= ~y$r_buff0_thd0~0_In824218788 ~y$r_buff1_thd0~0_Out824218788) (= ~z~0_Out824218788 ~__unbuffered_p1_EAX~0_Out824218788) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In824218788 0)) (= ~y$r_buff0_thd2~0_Out824218788 1) (= ~y$r_buff0_thd1~0_In824218788 ~y$r_buff1_thd1~0_Out824218788) (= ~y$r_buff1_thd2~0_Out824218788 ~y$r_buff0_thd2~0_In824218788) (= 1 ~z~0_Out824218788)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In824218788, ~a~0=~a~0_In824218788, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In824218788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In824218788, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In824218788} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out824218788, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In824218788, ~a~0=~a~0_In824218788, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out824218788, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out824218788, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out824218788, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In824218788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out824218788, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In824218788, ~z~0=~z~0_Out824218788, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out824218788} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:11:51,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1476601342 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1476601342 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1476601342 |P1Thread1of1ForFork1_#t~ite28_Out1476601342|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1476601342| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1476601342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1476601342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1476601342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1476601342, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1476601342|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:11:51,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1612125403 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1612125403 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1612125403 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1612125403 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1612125403|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite29_Out-1612125403| ~y$w_buff1_used~0_In-1612125403)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1612125403, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1612125403, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1612125403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1612125403} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1612125403, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1612125403|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1612125403, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1612125403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1612125403} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:11:51,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:11:51,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2115273311 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite23_Out2115273311| |P0Thread1of1ForFork0_#t~ite24_Out2115273311|) (= ~y$r_buff1_thd1~0_In2115273311 |P0Thread1of1ForFork0_#t~ite23_Out2115273311|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2115273311 256)))) (or (and (= (mod ~y$r_buff1_thd1~0_In2115273311 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In2115273311 256)) .cse0) (= (mod ~y$w_buff0_used~0_In2115273311 256) 0))) .cse1) (and (= ~y$r_buff1_thd1~0_In2115273311 |P0Thread1of1ForFork0_#t~ite24_Out2115273311|) (= |P0Thread1of1ForFork0_#t~ite23_In2115273311| |P0Thread1of1ForFork0_#t~ite23_Out2115273311|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2115273311, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115273311, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2115273311, ~weak$$choice2~0=~weak$$choice2~0_In2115273311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2115273311, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In2115273311|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2115273311, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115273311, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2115273311, ~weak$$choice2~0=~weak$$choice2~0_In2115273311, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out2115273311|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out2115273311|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2115273311} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-11-28 18:11:51,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:11:51,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_In278225137 ~y$r_buff0_thd2~0_Out278225137)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In278225137 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In278225137 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out278225137) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In278225137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In278225137} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out278225137|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In278225137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out278225137} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:11:51,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In434100095 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In434100095 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In434100095 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In434100095 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out434100095|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out434100095| ~y$r_buff1_thd2~0_In434100095) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In434100095, ~y$w_buff0_used~0=~y$w_buff0_used~0_In434100095, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In434100095, ~y$w_buff1_used~0=~y$w_buff1_used~0_In434100095} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In434100095, ~y$w_buff0_used~0=~y$w_buff0_used~0_In434100095, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out434100095|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In434100095, ~y$w_buff1_used~0=~y$w_buff1_used~0_In434100095} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:11:51,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:11:51,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:11:51,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In185916498 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In185916498 256) 0))) (or (and (= ~y~0_In185916498 |ULTIMATE.start_main_#t~ite34_Out185916498|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out185916498| ~y$w_buff1~0_In185916498)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In185916498, ~y~0=~y~0_In185916498, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185916498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185916498} OutVars{~y$w_buff1~0=~y$w_buff1~0_In185916498, ~y~0=~y~0_In185916498, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185916498, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out185916498|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185916498} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:51,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:51,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2044058656 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2044058656 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out2044058656|)) (and (= |ULTIMATE.start_main_#t~ite36_Out2044058656| ~y$w_buff0_used~0_In2044058656) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2044058656, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2044058656} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2044058656, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2044058656, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out2044058656|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:11:51,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In760471821 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In760471821 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In760471821 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In760471821 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out760471821|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In760471821 |ULTIMATE.start_main_#t~ite37_Out760471821|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In760471821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In760471821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In760471821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760471821} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In760471821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In760471821, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out760471821|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In760471821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760471821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:11:51,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1679294628 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1679294628 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1679294628| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out1679294628| ~y$r_buff0_thd0~0_In1679294628) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1679294628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1679294628} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1679294628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1679294628, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1679294628|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:11:51,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In356700801 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In356700801 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In356700801 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In356700801 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out356700801| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out356700801| ~y$r_buff1_thd0~0_In356700801) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In356700801, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In356700801, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In356700801, ~y$w_buff1_used~0=~y$w_buff1_used~0_In356700801} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In356700801, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out356700801|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In356700801, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In356700801, ~y$w_buff1_used~0=~y$w_buff1_used~0_In356700801} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:11:51,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:11:51,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:11:51 BasicIcfg [2019-11-28 18:11:51,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:11:51,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:11:51,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:11:51,288 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:11:51,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:36" (3/4) ... [2019-11-28 18:11:51,292 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:11:51,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= |v_ULTIMATE.start_main_~#t843~0.offset_26| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t843~0.base_37| 4)) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37|) |v_ULTIMATE.start_main_~#t843~0.offset_26| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37|)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t843~0.base_37|) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37| 1)) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_main_~#t843~0.base=|v_ULTIMATE.start_main_~#t843~0.base_37|, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ULTIMATE.start_main_~#t843~0.offset=|v_ULTIMATE.start_main_~#t843~0.offset_26|, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t844~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t843~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t844~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t843~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:11:51,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t844~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t844~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t844~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12|) |v_ULTIMATE.start_main_~#t844~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t844~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t844~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t844~0.base] because there is no mapped edge [2019-11-28 18:11:51,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~__unbuffered_p1_EBX~0_Out824218788 ~a~0_In824218788) (= ~y$r_buff0_thd0~0_In824218788 ~y$r_buff1_thd0~0_Out824218788) (= ~z~0_Out824218788 ~__unbuffered_p1_EAX~0_Out824218788) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In824218788 0)) (= ~y$r_buff0_thd2~0_Out824218788 1) (= ~y$r_buff0_thd1~0_In824218788 ~y$r_buff1_thd1~0_Out824218788) (= ~y$r_buff1_thd2~0_Out824218788 ~y$r_buff0_thd2~0_In824218788) (= 1 ~z~0_Out824218788)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In824218788, ~a~0=~a~0_In824218788, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In824218788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In824218788, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In824218788} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out824218788, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In824218788, ~a~0=~a~0_In824218788, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out824218788, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out824218788, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out824218788, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In824218788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out824218788, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In824218788, ~z~0=~z~0_Out824218788, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out824218788} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:11:51,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1476601342 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1476601342 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1476601342 |P1Thread1of1ForFork1_#t~ite28_Out1476601342|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1476601342| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1476601342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1476601342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1476601342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1476601342, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1476601342|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:11:51,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1612125403 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1612125403 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1612125403 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1612125403 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1612125403|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite29_Out-1612125403| ~y$w_buff1_used~0_In-1612125403)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1612125403, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1612125403, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1612125403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1612125403} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1612125403, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1612125403|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1612125403, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1612125403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1612125403} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:11:51,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:11:51,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2115273311 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite23_Out2115273311| |P0Thread1of1ForFork0_#t~ite24_Out2115273311|) (= ~y$r_buff1_thd1~0_In2115273311 |P0Thread1of1ForFork0_#t~ite23_Out2115273311|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2115273311 256)))) (or (and (= (mod ~y$r_buff1_thd1~0_In2115273311 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In2115273311 256)) .cse0) (= (mod ~y$w_buff0_used~0_In2115273311 256) 0))) .cse1) (and (= ~y$r_buff1_thd1~0_In2115273311 |P0Thread1of1ForFork0_#t~ite24_Out2115273311|) (= |P0Thread1of1ForFork0_#t~ite23_In2115273311| |P0Thread1of1ForFork0_#t~ite23_Out2115273311|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2115273311, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115273311, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2115273311, ~weak$$choice2~0=~weak$$choice2~0_In2115273311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2115273311, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In2115273311|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2115273311, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115273311, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2115273311, ~weak$$choice2~0=~weak$$choice2~0_In2115273311, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out2115273311|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out2115273311|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2115273311} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-11-28 18:11:51,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:11:51,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_In278225137 ~y$r_buff0_thd2~0_Out278225137)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In278225137 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In278225137 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out278225137) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In278225137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In278225137} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out278225137|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In278225137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out278225137} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:11:51,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In434100095 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In434100095 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In434100095 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In434100095 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out434100095|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out434100095| ~y$r_buff1_thd2~0_In434100095) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In434100095, ~y$w_buff0_used~0=~y$w_buff0_used~0_In434100095, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In434100095, ~y$w_buff1_used~0=~y$w_buff1_used~0_In434100095} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In434100095, ~y$w_buff0_used~0=~y$w_buff0_used~0_In434100095, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out434100095|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In434100095, ~y$w_buff1_used~0=~y$w_buff1_used~0_In434100095} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:11:51,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:11:51,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:11:51,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In185916498 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In185916498 256) 0))) (or (and (= ~y~0_In185916498 |ULTIMATE.start_main_#t~ite34_Out185916498|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out185916498| ~y$w_buff1~0_In185916498)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In185916498, ~y~0=~y~0_In185916498, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185916498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185916498} OutVars{~y$w_buff1~0=~y$w_buff1~0_In185916498, ~y~0=~y~0_In185916498, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185916498, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out185916498|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185916498} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:51,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:51,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2044058656 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2044058656 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out2044058656|)) (and (= |ULTIMATE.start_main_#t~ite36_Out2044058656| ~y$w_buff0_used~0_In2044058656) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2044058656, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2044058656} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2044058656, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2044058656, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out2044058656|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:11:51,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In760471821 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In760471821 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In760471821 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In760471821 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out760471821|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In760471821 |ULTIMATE.start_main_#t~ite37_Out760471821|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In760471821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In760471821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In760471821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760471821} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In760471821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In760471821, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out760471821|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In760471821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760471821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:11:51,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1679294628 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1679294628 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1679294628| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out1679294628| ~y$r_buff0_thd0~0_In1679294628) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1679294628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1679294628} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1679294628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1679294628, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1679294628|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:11:51,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In356700801 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In356700801 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In356700801 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In356700801 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out356700801| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out356700801| ~y$r_buff1_thd0~0_In356700801) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In356700801, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In356700801, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In356700801, ~y$w_buff1_used~0=~y$w_buff1_used~0_In356700801} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In356700801, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out356700801|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In356700801, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In356700801, ~y$w_buff1_used~0=~y$w_buff1_used~0_In356700801} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:11:51,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:11:51,443 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:11:51,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:11:51,448 INFO L168 Benchmark]: Toolchain (without parser) took 16411.40 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 516.4 MB). Free memory was 957.7 MB in the beginning and 935.0 MB in the end (delta: 22.6 MB). Peak memory consumption was 539.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:51,450 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:11:51,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:51,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:51,451 INFO L168 Benchmark]: Boogie Preprocessor took 43.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:11:51,452 INFO L168 Benchmark]: RCFGBuilder took 775.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:51,452 INFO L168 Benchmark]: TraceAbstraction took 14535.50 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 378.5 MB). Free memory was 1.0 GB in the beginning and 959.3 MB in the end (delta: 90.6 MB). Peak memory consumption was 469.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:51,453 INFO L168 Benchmark]: Witness Printer took 157.03 ms. Allocated memory is still 1.5 GB. Free memory was 959.3 MB in the beginning and 935.0 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:51,455 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 834.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 775.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14535.50 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 378.5 MB). Free memory was 1.0 GB in the beginning and 959.3 MB in the end (delta: 90.6 MB). Peak memory consumption was 469.2 MB. Max. memory is 11.5 GB. * Witness Printer took 157.03 ms. Allocated memory is still 1.5 GB. Free memory was 959.3 MB in the beginning and 935.0 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1429 SDtfs, 1312 SDslu, 2811 SDs, 0 SdLazy, 1126 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10870occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 6251 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 58892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...