./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix031_pso.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_pso.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 5673c8fc999c6c2aa4e3139a5db49468705e6072 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:28,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:28,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:28,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:28,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:28,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:28,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:28,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:28,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:28,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:28,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:28,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:28,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:28,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:28,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:28,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:28,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:28,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:28,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:28,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:28,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:28,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:28,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:28,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:28,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:28,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:28,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:28,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:28,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:28,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:28,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:28,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:28,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:28,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:28,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:28,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:28,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:28,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:28,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:28,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:28,738 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:28,774 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:28,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:28,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:28,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:28,779 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:28,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:28,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:28,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:28,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:28,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:28,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:28,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:28,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:28,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:28,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:28,785 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:28,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:28,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:28,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:28,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:28,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:28,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:28,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:28,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:28,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:28,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:28,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:28,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:28,791 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:28,791 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 -> 5673c8fc999c6c2aa4e3139a5db49468705e6072 [2019-11-28 18:11:29,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:29,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:29,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:29,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:29,145 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:29,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-11-28 18:11:29,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfa45620/fbb5771e1a30463d8c7735d1194b5991/FLAG51a5ec275 [2019-11-28 18:11:29,747 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:29,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-11-28 18:11:29,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfa45620/fbb5771e1a30463d8c7735d1194b5991/FLAG51a5ec275 [2019-11-28 18:11:30,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfa45620/fbb5771e1a30463d8c7735d1194b5991 [2019-11-28 18:11:30,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:30,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:30,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:30,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:30,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:30,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:30" (1/1) ... [2019-11-28 18:11:30,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ad7dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:30, skipping insertion in model container [2019-11-28 18:11:30,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:30" (1/1) ... [2019-11-28 18:11:30,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:30,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:30,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:30,679 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:30,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:30,848 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:30,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:30 WrapperNode [2019-11-28 18:11:30,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:30,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:30,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:30,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:30,859 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:30" (1/1) ... [2019-11-28 18:11:30,879 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:30" (1/1) ... [2019-11-28 18:11:30,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:30,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:30,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:30,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:30,927 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:30" (1/1) ... [2019-11-28 18:11:30,927 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:30" (1/1) ... [2019-11-28 18:11:30,931 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:30" (1/1) ... [2019-11-28 18:11:30,932 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:30" (1/1) ... [2019-11-28 18:11:30,941 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:30" (1/1) ... [2019-11-28 18:11:30,945 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:30" (1/1) ... [2019-11-28 18:11:30,949 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:30" (1/1) ... [2019-11-28 18:11:30,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:30,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:30,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:30,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:30,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:30" (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:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:31,021 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:31,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:31,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:31,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:31,027 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:31,710 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:11:31,710 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:11:31,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:31 BoogieIcfgContainer [2019-11-28 18:11:31,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:11:31,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:11:31,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:11:31,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:11:31,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:30" (1/3) ... [2019-11-28 18:11:31,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5d649a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:31, skipping insertion in model container [2019-11-28 18:11:31,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:30" (2/3) ... [2019-11-28 18:11:31,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5d649a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:31, skipping insertion in model container [2019-11-28 18:11:31,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:31" (3/3) ... [2019-11-28 18:11:31,720 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.opt.i [2019-11-28 18:11:31,730 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:11:31,731 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:11:31,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:11:31,739 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:11:31,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,778 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,823 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,824 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:31,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:31,856 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:11:31,875 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:11:31,875 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:11:31,875 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:11:31,875 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:11:31,875 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:11:31,875 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:11:31,876 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:11:31,876 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:11:31,889 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-11-28 18:11:31,891 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-11-28 18:11:31,969 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-11-28 18:11:31,970 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:31,985 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:32,004 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-11-28 18:11:32,047 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-11-28 18:11:32,047 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:32,053 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:32,068 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:11:32,069 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:11:36,668 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 18:11:36,972 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-11-28 18:11:37,127 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 18:11:37,291 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-28 18:11:37,408 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:11:37,449 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-11-28 18:11:37,450 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-11-28 18:11:37,453 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-11-28 18:11:37,885 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-11-28 18:11:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-11-28 18:11:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:11:37,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:37,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:11:37,898 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:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-11-28 18:11:37,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:37,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992360789] [2019-11-28 18:11:37,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:38,234 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:38,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992360789] [2019-11-28 18:11:38,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:38,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:38,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182388883] [2019-11-28 18:11:38,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:38,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:38,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:38,275 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-11-28 18:11:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:38,547 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-11-28 18:11:38,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:38,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:11:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:38,635 INFO L225 Difference]: With dead ends: 6414 [2019-11-28 18:11:38,635 INFO L226 Difference]: Without dead ends: 6042 [2019-11-28 18:11:38,637 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:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-11-28 18:11:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-11-28 18:11:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-11-28 18:11:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-11-28 18:11:39,049 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-11-28 18:11:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:39,050 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-11-28 18:11:39,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-11-28 18:11:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:11:39,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:39,056 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:39,056 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:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-11-28 18:11:39,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:39,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316574646] [2019-11-28 18:11:39,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:39,148 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:39,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316574646] [2019-11-28 18:11:39,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:39,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:39,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166872703] [2019-11-28 18:11:39,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:39,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:39,152 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 3 states. [2019-11-28 18:11:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:39,188 INFO L93 Difference]: Finished difference Result 1215 states and 3009 transitions. [2019-11-28 18:11:39,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:39,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:11:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:39,197 INFO L225 Difference]: With dead ends: 1215 [2019-11-28 18:11:39,197 INFO L226 Difference]: Without dead ends: 1215 [2019-11-28 18:11:39,199 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:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-11-28 18:11:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2019-11-28 18:11:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-11-28 18:11:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3009 transitions. [2019-11-28 18:11:39,237 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3009 transitions. Word has length 11 [2019-11-28 18:11:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:39,238 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 3009 transitions. [2019-11-28 18:11:39,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3009 transitions. [2019-11-28 18:11:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:39,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:39,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:39,245 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:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-11-28 18:11:39,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:39,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874073579] [2019-11-28 18:11:39,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:39,347 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:39,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874073579] [2019-11-28 18:11:39,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:39,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:39,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906583482] [2019-11-28 18:11:39,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:39,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:39,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:39,349 INFO L87 Difference]: Start difference. First operand 1215 states and 3009 transitions. Second operand 3 states. [2019-11-28 18:11:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:39,425 INFO L93 Difference]: Finished difference Result 1870 states and 4688 transitions. [2019-11-28 18:11:39,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:39,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:11:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:39,437 INFO L225 Difference]: With dead ends: 1870 [2019-11-28 18:11:39,437 INFO L226 Difference]: Without dead ends: 1870 [2019-11-28 18:11:39,437 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:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-11-28 18:11:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1354. [2019-11-28 18:11:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2019-11-28 18:11:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 3400 transitions. [2019-11-28 18:11:39,485 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 3400 transitions. Word has length 14 [2019-11-28 18:11:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:39,486 INFO L462 AbstractCegarLoop]: Abstraction has 1354 states and 3400 transitions. [2019-11-28 18:11:39,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 3400 transitions. [2019-11-28 18:11:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:39,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:39,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:39,488 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:39,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:39,488 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-11-28 18:11:39,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:39,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977220600] [2019-11-28 18:11:39,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:39,567 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:39,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977220600] [2019-11-28 18:11:39,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:39,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:39,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807224681] [2019-11-28 18:11:39,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:39,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:39,570 INFO L87 Difference]: Start difference. First operand 1354 states and 3400 transitions. Second operand 4 states. [2019-11-28 18:11:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:39,809 INFO L93 Difference]: Finished difference Result 1775 states and 4313 transitions. [2019-11-28 18:11:39,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:39,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:39,826 INFO L225 Difference]: With dead ends: 1775 [2019-11-28 18:11:39,827 INFO L226 Difference]: Without dead ends: 1775 [2019-11-28 18:11:39,827 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:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-11-28 18:11:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1643. [2019-11-28 18:11:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2019-11-28 18:11:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 4018 transitions. [2019-11-28 18:11:39,881 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 4018 transitions. Word has length 14 [2019-11-28 18:11:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:39,882 INFO L462 AbstractCegarLoop]: Abstraction has 1643 states and 4018 transitions. [2019-11-28 18:11:39,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 4018 transitions. [2019-11-28 18:11:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:39,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:39,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:39,884 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:39,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-11-28 18:11:39,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:39,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663411337] [2019-11-28 18:11:39,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:39,973 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:39,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663411337] [2019-11-28 18:11:39,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:39,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:39,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000451265] [2019-11-28 18:11:39,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:39,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:39,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:39,977 INFO L87 Difference]: Start difference. First operand 1643 states and 4018 transitions. Second operand 4 states. [2019-11-28 18:11:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:40,145 INFO L93 Difference]: Finished difference Result 2036 states and 4889 transitions. [2019-11-28 18:11:40,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:40,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:40,159 INFO L225 Difference]: With dead ends: 2036 [2019-11-28 18:11:40,160 INFO L226 Difference]: Without dead ends: 2036 [2019-11-28 18:11:40,160 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:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2019-11-28 18:11:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1664. [2019-11-28 18:11:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-11-28 18:11:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4070 transitions. [2019-11-28 18:11:40,212 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 4070 transitions. Word has length 14 [2019-11-28 18:11:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:40,212 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 4070 transitions. [2019-11-28 18:11:40,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 4070 transitions. [2019-11-28 18:11:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:11:40,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:40,216 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:40,217 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:40,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-11-28 18:11:40,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:40,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151295593] [2019-11-28 18:11:40,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:40,288 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:40,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151295593] [2019-11-28 18:11:40,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:40,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:40,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671677251] [2019-11-28 18:11:40,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:40,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:40,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:40,291 INFO L87 Difference]: Start difference. First operand 1664 states and 4070 transitions. Second operand 5 states. [2019-11-28 18:11:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:40,599 INFO L93 Difference]: Finished difference Result 2291 states and 5479 transitions. [2019-11-28 18:11:40,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:40,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:11:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:40,613 INFO L225 Difference]: With dead ends: 2291 [2019-11-28 18:11:40,614 INFO L226 Difference]: Without dead ends: 2289 [2019-11-28 18:11:40,614 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:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-11-28 18:11:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1836. [2019-11-28 18:11:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-11-28 18:11:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4456 transitions. [2019-11-28 18:11:40,664 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4456 transitions. Word has length 26 [2019-11-28 18:11:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:40,665 INFO L462 AbstractCegarLoop]: Abstraction has 1836 states and 4456 transitions. [2019-11-28 18:11:40,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4456 transitions. [2019-11-28 18:11:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:11:40,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:40,669 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:40,669 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:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:40,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2141135354, now seen corresponding path program 1 times [2019-11-28 18:11:40,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:40,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843466338] [2019-11-28 18:11:40,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:40,804 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:40,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843466338] [2019-11-28 18:11:40,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:40,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:11:40,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515465439] [2019-11-28 18:11:40,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:40,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:40,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:40,806 INFO L87 Difference]: Start difference. First operand 1836 states and 4456 transitions. Second operand 5 states. [2019-11-28 18:11:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:41,180 INFO L93 Difference]: Finished difference Result 2650 states and 6314 transitions. [2019-11-28 18:11:41,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:11:41,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:11:41,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:41,196 INFO L225 Difference]: With dead ends: 2650 [2019-11-28 18:11:41,196 INFO L226 Difference]: Without dead ends: 2650 [2019-11-28 18:11:41,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:11:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2019-11-28 18:11:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2252. [2019-11-28 18:11:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2252 states. [2019-11-28 18:11:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 5409 transitions. [2019-11-28 18:11:41,253 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 5409 transitions. Word has length 26 [2019-11-28 18:11:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:41,254 INFO L462 AbstractCegarLoop]: Abstraction has 2252 states and 5409 transitions. [2019-11-28 18:11:41,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 5409 transitions. [2019-11-28 18:11:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:11:41,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:41,258 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:41,258 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:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:41,259 INFO L82 PathProgramCache]: Analyzing trace with hash 225797087, now seen corresponding path program 1 times [2019-11-28 18:11:41,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:41,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872391967] [2019-11-28 18:11:41,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:41,335 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:41,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872391967] [2019-11-28 18:11:41,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:41,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:41,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710382746] [2019-11-28 18:11:41,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:41,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:41,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:41,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:41,338 INFO L87 Difference]: Start difference. First operand 2252 states and 5409 transitions. Second operand 5 states. [2019-11-28 18:11:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:41,550 INFO L93 Difference]: Finished difference Result 2774 states and 6566 transitions. [2019-11-28 18:11:41,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:41,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:11:41,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:41,560 INFO L225 Difference]: With dead ends: 2774 [2019-11-28 18:11:41,561 INFO L226 Difference]: Without dead ends: 2772 [2019-11-28 18:11:41,561 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:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-11-28 18:11:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2152. [2019-11-28 18:11:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-11-28 18:11:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 5178 transitions. [2019-11-28 18:11:41,618 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 5178 transitions. Word has length 27 [2019-11-28 18:11:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:41,618 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 5178 transitions. [2019-11-28 18:11:41,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 5178 transitions. [2019-11-28 18:11:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:11:41,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:41,623 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:41,623 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:41,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:41,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1661250727, now seen corresponding path program 1 times [2019-11-28 18:11:41,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:41,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872567413] [2019-11-28 18:11:41,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:41,914 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:41,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872567413] [2019-11-28 18:11:41,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:41,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:41,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231515720] [2019-11-28 18:11:41,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:11:41,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:41,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:11:41,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:11:41,916 INFO L87 Difference]: Start difference. First operand 2152 states and 5178 transitions. Second operand 8 states. [2019-11-28 18:11:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:42,192 INFO L93 Difference]: Finished difference Result 2151 states and 5176 transitions. [2019-11-28 18:11:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:42,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-28 18:11:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:42,198 INFO L225 Difference]: With dead ends: 2151 [2019-11-28 18:11:42,199 INFO L226 Difference]: Without dead ends: 2151 [2019-11-28 18:11:42,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:11:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2019-11-28 18:11:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 2151. [2019-11-28 18:11:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2019-11-28 18:11:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 5176 transitions. [2019-11-28 18:11:42,245 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 5176 transitions. Word has length 27 [2019-11-28 18:11:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:42,245 INFO L462 AbstractCegarLoop]: Abstraction has 2151 states and 5176 transitions. [2019-11-28 18:11:42,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:11:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 5176 transitions. [2019-11-28 18:11:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:11:42,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:42,249 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] [2019-11-28 18:11:42,250 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:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash -144289883, now seen corresponding path program 1 times [2019-11-28 18:11:42,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:42,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768318613] [2019-11-28 18:11:42,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:42,533 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:42,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768318613] [2019-11-28 18:11:42,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:42,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:11:42,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153024167] [2019-11-28 18:11:42,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:11:42,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:42,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:11:42,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:11:42,535 INFO L87 Difference]: Start difference. First operand 2151 states and 5176 transitions. Second operand 8 states. [2019-11-28 18:11:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:43,209 INFO L93 Difference]: Finished difference Result 4018 states and 9684 transitions. [2019-11-28 18:11:43,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:11:43,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-28 18:11:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:43,225 INFO L225 Difference]: With dead ends: 4018 [2019-11-28 18:11:43,225 INFO L226 Difference]: Without dead ends: 3360 [2019-11-28 18:11:43,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:11:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-11-28 18:11:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3264. [2019-11-28 18:11:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2019-11-28 18:11:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 7844 transitions. [2019-11-28 18:11:43,324 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 7844 transitions. Word has length 28 [2019-11-28 18:11:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:43,325 INFO L462 AbstractCegarLoop]: Abstraction has 3264 states and 7844 transitions. [2019-11-28 18:11:43,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:11:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 7844 transitions. [2019-11-28 18:11:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:11:43,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:43,333 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] [2019-11-28 18:11:43,334 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:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:43,334 INFO L82 PathProgramCache]: Analyzing trace with hash -724042887, now seen corresponding path program 2 times [2019-11-28 18:11:43,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:43,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386207281] [2019-11-28 18:11:43,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:43,431 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,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386207281] [2019-11-28 18:11:43,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:43,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:43,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877515383] [2019-11-28 18:11:43,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:43,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:43,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:43,434 INFO L87 Difference]: Start difference. First operand 3264 states and 7844 transitions. Second operand 4 states. [2019-11-28 18:11:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:43,457 INFO L93 Difference]: Finished difference Result 1668 states and 3804 transitions. [2019-11-28 18:11:43,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:11:43,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:11:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:43,462 INFO L225 Difference]: With dead ends: 1668 [2019-11-28 18:11:43,462 INFO L226 Difference]: Without dead ends: 1648 [2019-11-28 18:11:43,463 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:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-11-28 18:11:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 925. [2019-11-28 18:11:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-11-28 18:11:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 2098 transitions. [2019-11-28 18:11:43,489 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 2098 transitions. Word has length 28 [2019-11-28 18:11:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:43,489 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 2098 transitions. [2019-11-28 18:11:43,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 2098 transitions. [2019-11-28 18:11:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:11:43,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:43,493 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] [2019-11-28 18:11:43,493 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:43,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash -310616313, now seen corresponding path program 1 times [2019-11-28 18:11:43,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:43,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173307937] [2019-11-28 18:11:43,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:43,633 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,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173307937] [2019-11-28 18:11:43,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:43,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:43,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144787064] [2019-11-28 18:11:43,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:11:43,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:11:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:11:43,637 INFO L87 Difference]: Start difference. First operand 925 states and 2098 transitions. Second operand 6 states. [2019-11-28 18:11:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:44,179 INFO L93 Difference]: Finished difference Result 1208 states and 2651 transitions. [2019-11-28 18:11:44,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:11:44,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-28 18:11:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:44,183 INFO L225 Difference]: With dead ends: 1208 [2019-11-28 18:11:44,183 INFO L226 Difference]: Without dead ends: 1208 [2019-11-28 18:11:44,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:11:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2019-11-28 18:11:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 956. [2019-11-28 18:11:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-28 18:11:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2159 transitions. [2019-11-28 18:11:44,207 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2159 transitions. Word has length 41 [2019-11-28 18:11:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:44,208 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2159 transitions. [2019-11-28 18:11:44,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:11:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2159 transitions. [2019-11-28 18:11:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:11:44,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:44,211 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] [2019-11-28 18:11:44,211 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:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:44,212 INFO L82 PathProgramCache]: Analyzing trace with hash 372989159, now seen corresponding path program 2 times [2019-11-28 18:11:44,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:44,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761545564] [2019-11-28 18:11:44,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:44,341 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,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761545564] [2019-11-28 18:11:44,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:44,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:44,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120401477] [2019-11-28 18:11:44,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:44,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:44,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:44,352 INFO L87 Difference]: Start difference. First operand 956 states and 2159 transitions. Second operand 3 states. [2019-11-28 18:11:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:44,367 INFO L93 Difference]: Finished difference Result 954 states and 2154 transitions. [2019-11-28 18:11:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:44,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 18:11:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:44,372 INFO L225 Difference]: With dead ends: 954 [2019-11-28 18:11:44,372 INFO L226 Difference]: Without dead ends: 954 [2019-11-28 18:11:44,373 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:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-11-28 18:11:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 887. [2019-11-28 18:11:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-11-28 18:11:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2026 transitions. [2019-11-28 18:11:44,393 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 2026 transitions. Word has length 41 [2019-11-28 18:11:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:44,393 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 2026 transitions. [2019-11-28 18:11:44,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 2026 transitions. [2019-11-28 18:11:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:44,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:44,396 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:44,397 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:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1722201146, now seen corresponding path program 1 times [2019-11-28 18:11:44,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:44,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855718982] [2019-11-28 18:11:44,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:44,485 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,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855718982] [2019-11-28 18:11:44,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:44,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:11:44,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605211214] [2019-11-28 18:11:44,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:44,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:44,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:44,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:44,488 INFO L87 Difference]: Start difference. First operand 887 states and 2026 transitions. Second operand 5 states. [2019-11-28 18:11:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:44,517 INFO L93 Difference]: Finished difference Result 1543 states and 3554 transitions. [2019-11-28 18:11:44,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:44,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 18:11:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:44,520 INFO L225 Difference]: With dead ends: 1543 [2019-11-28 18:11:44,520 INFO L226 Difference]: Without dead ends: 684 [2019-11-28 18:11:44,521 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:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-11-28 18:11:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2019-11-28 18:11:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-11-28 18:11:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1576 transitions. [2019-11-28 18:11:44,535 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1576 transitions. Word has length 42 [2019-11-28 18:11:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:44,536 INFO L462 AbstractCegarLoop]: Abstraction has 684 states and 1576 transitions. [2019-11-28 18:11:44,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1576 transitions. [2019-11-28 18:11:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:44,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:44,538 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:44,539 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:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash -146556572, now seen corresponding path program 2 times [2019-11-28 18:11:44,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:44,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434071588] [2019-11-28 18:11:44,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:44,654 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,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434071588] [2019-11-28 18:11:44,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:44,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:44,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646999299] [2019-11-28 18:11:44,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:11:44,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:11:44,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:44,656 INFO L87 Difference]: Start difference. First operand 684 states and 1576 transitions. Second operand 7 states. [2019-11-28 18:11:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:44,843 INFO L93 Difference]: Finished difference Result 1118 states and 2505 transitions. [2019-11-28 18:11:44,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:11:44,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-28 18:11:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:44,847 INFO L225 Difference]: With dead ends: 1118 [2019-11-28 18:11:44,847 INFO L226 Difference]: Without dead ends: 737 [2019-11-28 18:11:44,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:11:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-11-28 18:11:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 695. [2019-11-28 18:11:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-11-28 18:11:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1581 transitions. [2019-11-28 18:11:44,862 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1581 transitions. Word has length 42 [2019-11-28 18:11:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:44,863 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1581 transitions. [2019-11-28 18:11:44,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:11:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1581 transitions. [2019-11-28 18:11:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:44,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:44,865 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:44,866 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:44,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:44,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 3 times [2019-11-28 18:11:44,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:44,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234809903] [2019-11-28 18:11:44,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:44,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:11:44,955 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:11:44,959 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) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t839~0.base_37|) (= 0 |v_ULTIMATE.start_main_~#t839~0.offset_26|) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t839~0.base_37| 1)) (= 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_~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_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t839~0.base_37| 4)) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t839~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t839~0.base_37|) |v_ULTIMATE.start_main_~#t839~0.offset_26| 0)) |v_#memory_int_15|) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= 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 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= 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) (= (select .cse0 |v_ULTIMATE.start_main_~#t839~0.base_37|) 0) (= v_~y$r_buff0_thd0~0_131 0) (= 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_~#t840~0.base=|v_ULTIMATE.start_main_~#t840~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, ~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, ULTIMATE.start_main_~#t839~0.offset=|v_ULTIMATE.start_main_~#t839~0.offset_26|, #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_~#t840~0.offset=|v_ULTIMATE.start_main_~#t840~0.offset_18|, 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_~#t839~0.base=|v_ULTIMATE.start_main_~#t839~0.base_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, ~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, ~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_~#t840~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, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t839~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t840~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t839~0.base, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~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, ~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:44,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t840~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t840~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t840~0.base_12| 4) |v_#length_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t840~0.base_12|)) (= |v_ULTIMATE.start_main_~#t840~0.offset_10| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t840~0.base_12| 1) |v_#valid_27|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t840~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t840~0.base_12|) |v_ULTIMATE.start_main_~#t840~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t840~0.offset=|v_ULTIMATE.start_main_~#t840~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t840~0.base=|v_ULTIMATE.start_main_~#t840~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t840~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t840~0.base] because there is no mapped edge [2019-11-28 18:11:44,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~y$r_buff1_thd2~0_Out-391375812 ~y$r_buff0_thd2~0_In-391375812) (= ~a~0_In-391375812 ~__unbuffered_p1_EBX~0_Out-391375812) (= ~z~0_Out-391375812 1) (= 1 ~y$r_buff0_thd2~0_Out-391375812) (= ~y$r_buff1_thd0~0_Out-391375812 ~y$r_buff0_thd0~0_In-391375812) (= ~z~0_Out-391375812 ~__unbuffered_p1_EAX~0_Out-391375812) (= ~y$r_buff1_thd1~0_Out-391375812 ~y$r_buff0_thd1~0_In-391375812) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-391375812))) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-391375812, ~a~0=~a~0_In-391375812, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-391375812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-391375812, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-391375812} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-391375812, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-391375812, ~a~0=~a~0_In-391375812, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-391375812, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-391375812, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-391375812, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-391375812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-391375812, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-391375812, ~z~0=~z~0_Out-391375812, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-391375812} 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:44,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1037062484 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1037062484 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1037062484| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1037062484| ~y$w_buff0_used~0_In-1037062484)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1037062484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1037062484} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1037062484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1037062484, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1037062484|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:11:44,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In508902313 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In508902313 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In508902313 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In508902313 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out508902313| ~y$w_buff1_used~0_In508902313) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out508902313|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In508902313, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508902313, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In508902313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508902313} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In508902313, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out508902313|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508902313, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In508902313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508902313} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:11:44,967 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:44,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-185266906 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd1~0_In-185266906 |P0Thread1of1ForFork0_#t~ite24_Out-185266906|) (= |P0Thread1of1ForFork0_#t~ite23_In-185266906| |P0Thread1of1ForFork0_#t~ite23_Out-185266906|)) (and (= |P0Thread1of1ForFork0_#t~ite23_Out-185266906| |P0Thread1of1ForFork0_#t~ite24_Out-185266906|) (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-185266906 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd1~0_In-185266906 256)) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In-185266906 256) 0)) (= (mod ~y$w_buff0_used~0_In-185266906 256) 0))) (= ~y$r_buff1_thd1~0_In-185266906 |P0Thread1of1ForFork0_#t~ite23_Out-185266906|) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-185266906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-185266906, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-185266906, ~weak$$choice2~0=~weak$$choice2~0_In-185266906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185266906, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-185266906|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-185266906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-185266906, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-185266906, ~weak$$choice2~0=~weak$$choice2~0_In-185266906, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-185266906|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-185266906|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185266906} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-11-28 18:11:44,968 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:44,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1116127288 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1116127288 256) 0)) (.cse1 (= ~y$r_buff0_thd2~0_In-1116127288 ~y$r_buff0_thd2~0_Out-1116127288))) (or (and .cse0 .cse1) (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-1116127288) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1116127288, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1116127288} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1116127288|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1116127288, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1116127288} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:11:44,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In282444188 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In282444188 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In282444188 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In282444188 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out282444188| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite31_Out282444188| ~y$r_buff1_thd2~0_In282444188) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In282444188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In282444188, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In282444188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In282444188} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In282444188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In282444188, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out282444188|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In282444188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In282444188} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:11:44,969 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:44,969 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:44,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1732111025 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1732111025 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1732111025| ~y~0_In-1732111025)) (and (= |ULTIMATE.start_main_#t~ite34_Out-1732111025| ~y$w_buff1~0_In-1732111025) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1732111025, ~y~0=~y~0_In-1732111025, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1732111025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732111025} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1732111025, ~y~0=~y~0_In-1732111025, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1732111025, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1732111025|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732111025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:44,970 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:44,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In401026777 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In401026777 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out401026777| 0)) (and (= |ULTIMATE.start_main_#t~ite36_Out401026777| ~y$w_buff0_used~0_In401026777) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In401026777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In401026777} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In401026777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In401026777, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out401026777|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:11:44,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-799384601 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-799384601 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-799384601 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-799384601 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-799384601 |ULTIMATE.start_main_#t~ite37_Out-799384601|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-799384601| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-799384601, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-799384601, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-799384601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799384601} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-799384601, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-799384601, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-799384601|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-799384601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799384601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:11:44,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-749683747 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-749683747 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-749683747| ~y$r_buff0_thd0~0_In-749683747)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-749683747|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-749683747, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-749683747} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-749683747, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-749683747, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-749683747|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:11:44,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1984756876 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1984756876 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1984756876 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1984756876 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1984756876|)) (and (= ~y$r_buff1_thd0~0_In1984756876 |ULTIMATE.start_main_#t~ite39_Out1984756876|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1984756876, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1984756876, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1984756876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984756876} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1984756876, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1984756876|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1984756876, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1984756876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984756876} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:11:44,973 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:45,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:11:45 BasicIcfg [2019-11-28 18:11:45,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:11:45,054 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:11:45,054 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:11:45,054 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:11:45,055 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:31" (3/4) ... [2019-11-28 18:11:45,058 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:11:45,059 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) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t839~0.base_37|) (= 0 |v_ULTIMATE.start_main_~#t839~0.offset_26|) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t839~0.base_37| 1)) (= 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_~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_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t839~0.base_37| 4)) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t839~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t839~0.base_37|) |v_ULTIMATE.start_main_~#t839~0.offset_26| 0)) |v_#memory_int_15|) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= 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 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= 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) (= (select .cse0 |v_ULTIMATE.start_main_~#t839~0.base_37|) 0) (= v_~y$r_buff0_thd0~0_131 0) (= 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_~#t840~0.base=|v_ULTIMATE.start_main_~#t840~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, ~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, ULTIMATE.start_main_~#t839~0.offset=|v_ULTIMATE.start_main_~#t839~0.offset_26|, #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_~#t840~0.offset=|v_ULTIMATE.start_main_~#t840~0.offset_18|, 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_~#t839~0.base=|v_ULTIMATE.start_main_~#t839~0.base_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, ~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, ~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_~#t840~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, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t839~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t840~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t839~0.base, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~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, ~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:45,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t840~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t840~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t840~0.base_12| 4) |v_#length_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t840~0.base_12|)) (= |v_ULTIMATE.start_main_~#t840~0.offset_10| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t840~0.base_12| 1) |v_#valid_27|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t840~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t840~0.base_12|) |v_ULTIMATE.start_main_~#t840~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t840~0.offset=|v_ULTIMATE.start_main_~#t840~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t840~0.base=|v_ULTIMATE.start_main_~#t840~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t840~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t840~0.base] because there is no mapped edge [2019-11-28 18:11:45,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~y$r_buff1_thd2~0_Out-391375812 ~y$r_buff0_thd2~0_In-391375812) (= ~a~0_In-391375812 ~__unbuffered_p1_EBX~0_Out-391375812) (= ~z~0_Out-391375812 1) (= 1 ~y$r_buff0_thd2~0_Out-391375812) (= ~y$r_buff1_thd0~0_Out-391375812 ~y$r_buff0_thd0~0_In-391375812) (= ~z~0_Out-391375812 ~__unbuffered_p1_EAX~0_Out-391375812) (= ~y$r_buff1_thd1~0_Out-391375812 ~y$r_buff0_thd1~0_In-391375812) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-391375812))) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-391375812, ~a~0=~a~0_In-391375812, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-391375812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-391375812, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-391375812} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-391375812, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-391375812, ~a~0=~a~0_In-391375812, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-391375812, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-391375812, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-391375812, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-391375812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-391375812, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-391375812, ~z~0=~z~0_Out-391375812, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-391375812} 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:45,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1037062484 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1037062484 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1037062484| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1037062484| ~y$w_buff0_used~0_In-1037062484)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1037062484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1037062484} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1037062484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1037062484, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1037062484|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:11:45,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In508902313 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In508902313 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In508902313 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In508902313 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out508902313| ~y$w_buff1_used~0_In508902313) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out508902313|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In508902313, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508902313, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In508902313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508902313} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In508902313, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out508902313|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508902313, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In508902313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508902313} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:11:45,065 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:45,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-185266906 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd1~0_In-185266906 |P0Thread1of1ForFork0_#t~ite24_Out-185266906|) (= |P0Thread1of1ForFork0_#t~ite23_In-185266906| |P0Thread1of1ForFork0_#t~ite23_Out-185266906|)) (and (= |P0Thread1of1ForFork0_#t~ite23_Out-185266906| |P0Thread1of1ForFork0_#t~ite24_Out-185266906|) (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-185266906 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd1~0_In-185266906 256)) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In-185266906 256) 0)) (= (mod ~y$w_buff0_used~0_In-185266906 256) 0))) (= ~y$r_buff1_thd1~0_In-185266906 |P0Thread1of1ForFork0_#t~ite23_Out-185266906|) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-185266906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-185266906, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-185266906, ~weak$$choice2~0=~weak$$choice2~0_In-185266906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185266906, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-185266906|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-185266906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-185266906, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-185266906, ~weak$$choice2~0=~weak$$choice2~0_In-185266906, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-185266906|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-185266906|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185266906} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-11-28 18:11:45,066 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:45,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1116127288 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1116127288 256) 0)) (.cse1 (= ~y$r_buff0_thd2~0_In-1116127288 ~y$r_buff0_thd2~0_Out-1116127288))) (or (and .cse0 .cse1) (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-1116127288) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1116127288, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1116127288} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1116127288|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1116127288, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1116127288} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:11:45,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In282444188 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In282444188 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In282444188 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In282444188 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out282444188| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite31_Out282444188| ~y$r_buff1_thd2~0_In282444188) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In282444188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In282444188, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In282444188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In282444188} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In282444188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In282444188, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out282444188|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In282444188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In282444188} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:11:45,067 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:45,067 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:45,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1732111025 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1732111025 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1732111025| ~y~0_In-1732111025)) (and (= |ULTIMATE.start_main_#t~ite34_Out-1732111025| ~y$w_buff1~0_In-1732111025) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1732111025, ~y~0=~y~0_In-1732111025, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1732111025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732111025} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1732111025, ~y~0=~y~0_In-1732111025, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1732111025, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1732111025|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732111025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:45,067 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:45,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In401026777 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In401026777 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out401026777| 0)) (and (= |ULTIMATE.start_main_#t~ite36_Out401026777| ~y$w_buff0_used~0_In401026777) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In401026777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In401026777} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In401026777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In401026777, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out401026777|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:11:45,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-799384601 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-799384601 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-799384601 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-799384601 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-799384601 |ULTIMATE.start_main_#t~ite37_Out-799384601|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-799384601| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-799384601, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-799384601, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-799384601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799384601} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-799384601, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-799384601, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-799384601|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-799384601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799384601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:11:45,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-749683747 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-749683747 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-749683747| ~y$r_buff0_thd0~0_In-749683747)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-749683747|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-749683747, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-749683747} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-749683747, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-749683747, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-749683747|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:11:45,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1984756876 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1984756876 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1984756876 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1984756876 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1984756876|)) (and (= ~y$r_buff1_thd0~0_In1984756876 |ULTIMATE.start_main_#t~ite39_Out1984756876|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1984756876, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1984756876, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1984756876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984756876} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1984756876, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1984756876|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1984756876, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1984756876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984756876} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:11:45,069 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:45,206 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:11:45,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:11:45,207 INFO L168 Benchmark]: Toolchain (without parser) took 15173.72 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 428.3 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -224.9 MB). Peak memory consumption was 203.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:45,208 INFO L168 Benchmark]: CDTParser took 0.81 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:45,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -139.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:45,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.35 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:45,212 INFO L168 Benchmark]: Boogie Preprocessor took 37.00 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:45,212 INFO L168 Benchmark]: RCFGBuilder took 757.49 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: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:45,213 INFO L168 Benchmark]: TraceAbstraction took 13340.23 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 296.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -154.6 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:45,216 INFO L168 Benchmark]: Witness Printer took 152.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:45,218 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.81 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 813.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -139.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.35 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.00 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 757.49 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: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13340.23 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 296.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -154.6 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. * Witness Printer took 152.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 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(&t839, ((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(&t840, ((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: 13.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1779 SDtfs, 1645 SDslu, 3097 SDs, 0 SdLazy, 1865 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6574occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 3671 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 86765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...