./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer --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 bc36f6abe56a4a6aa30bcfd05e07f22825f13dcd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-12-07 10:45:25,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:45:25,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:45:25,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:45:25,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:45:25,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:45:25,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:45:25,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:45:25,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:45:25,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:45:25,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:45:25,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:45:25,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:45:25,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:45:25,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:45:25,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:45:25,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:45:25,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:45:25,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:45:25,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:45:25,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:45:25,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:45:25,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:45:25,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:45:25,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:45:25,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:45:25,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:45:25,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:45:25,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:45:25,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:45:25,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:45:25,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:45:25,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:45:25,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:45:25,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:45:25,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:45:25,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:45:25,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:45:25,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:45:25,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:45:25,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:45:25,414 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:45:25,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:45:25,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:45:25,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:45:25,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:45:25,428 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:45:25,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:45:25,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:45:25,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:45:25,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:45:25,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:45:25,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:45:25,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:45:25,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:45:25,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:45:25,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:45:25,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:45:25,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:45:25,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:45:25,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:45:25,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:45:25,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:45:25,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:45:25,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:45:25,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:45:25,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:45:25,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:45:25,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:45:25,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:45:25,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:45:25,433 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer 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 -> bc36f6abe56a4a6aa30bcfd05e07f22825f13dcd [2019-12-07 10:45:25,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:45:25,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:45:25,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:45:25,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:45:25,551 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:45:25,551 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix014_power.opt.i [2019-12-07 10:45:25,589 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/data/c099c580a/1d2bc01cdd5443cba90d81c5cc275151/FLAG28dc7dfe6 [2019-12-07 10:45:26,039 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:45:26,039 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/sv-benchmarks/c/pthread-wmm/mix014_power.opt.i [2019-12-07 10:45:26,050 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/data/c099c580a/1d2bc01cdd5443cba90d81c5cc275151/FLAG28dc7dfe6 [2019-12-07 10:45:26,059 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/data/c099c580a/1d2bc01cdd5443cba90d81c5cc275151 [2019-12-07 10:45:26,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:45:26,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:45:26,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:45:26,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:45:26,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:45:26,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26, skipping insertion in model container [2019-12-07 10:45:26,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:45:26,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:45:26,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:45:26,373 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:45:26,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:45:26,474 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:45:26,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26 WrapperNode [2019-12-07 10:45:26,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:45:26,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:45:26,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:45:26,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:45:26,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:45:26,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:45:26,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:45:26,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:45:26,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... [2019-12-07 10:45:26,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:45:26,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:45:26,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:45:26,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:45:26,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/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-12-07 10:45:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:45:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:45:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:45:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:45:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:45:26,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:45:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:45:26,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:45:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:45:26,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:45:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 10:45:26,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 10:45:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:45:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:45:26,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:45:26,598 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:45:27,012 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:45:27,012 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:45:27,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:45:27 BoogieIcfgContainer [2019-12-07 10:45:27,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:45:27,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:45:27,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:45:27,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:45:27,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:45:26" (1/3) ... [2019-12-07 10:45:27,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e621841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:45:27, skipping insertion in model container [2019-12-07 10:45:27,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:26" (2/3) ... [2019-12-07 10:45:27,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e621841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:45:27, skipping insertion in model container [2019-12-07 10:45:27,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:45:27" (3/3) ... [2019-12-07 10:45:27,018 INFO L109 eAbstractionObserver]: Analyzing ICFG mix014_power.opt.i [2019-12-07 10:45:27,025 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:45:27,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:45:27,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:45:27,031 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:45:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,062 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,062 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,076 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,076 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,076 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,076 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,076 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:27,101 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 10:45:27,113 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:45:27,113 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:45:27,114 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:45:27,114 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:45:27,114 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:45:27,114 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:45:27,114 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:45:27,114 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:45:27,126 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 10:45:27,127 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 10:45:27,194 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 10:45:27,194 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:45:27,207 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 10:45:27,229 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 10:45:27,268 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 10:45:27,269 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:45:27,277 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 10:45:27,303 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 10:45:27,304 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:45:30,769 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 10:45:30,962 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 10:45:31,077 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147467 [2019-12-07 10:45:31,077 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-07 10:45:31,080 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 134 transitions [2019-12-07 10:45:39,711 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 94794 states. [2019-12-07 10:45:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 94794 states. [2019-12-07 10:45:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:45:39,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:39,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:39,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:39,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:39,722 INFO L82 PathProgramCache]: Analyzing trace with hash -284739831, now seen corresponding path program 1 times [2019-12-07 10:45:39,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:45:39,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592311060] [2019-12-07 10:45:39,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:39,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592311060] [2019-12-07 10:45:39,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:45:39,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:45:39,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903553260] [2019-12-07 10:45:39,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:45:39,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:45:39,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:45:39,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:45:39,896 INFO L87 Difference]: Start difference. First operand 94794 states. Second operand 3 states. [2019-12-07 10:45:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:40,543 INFO L93 Difference]: Finished difference Result 94058 states and 432536 transitions. [2019-12-07 10:45:40,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:45:40,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 10:45:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:41,231 INFO L225 Difference]: With dead ends: 94058 [2019-12-07 10:45:41,231 INFO L226 Difference]: Without dead ends: 88038 [2019-12-07 10:45:41,232 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-12-07 10:45:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88038 states. [2019-12-07 10:45:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88038 to 88038. [2019-12-07 10:45:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88038 states. [2019-12-07 10:45:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88038 states to 88038 states and 404604 transitions. [2019-12-07 10:45:44,232 INFO L78 Accepts]: Start accepts. Automaton has 88038 states and 404604 transitions. Word has length 9 [2019-12-07 10:45:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:44,233 INFO L462 AbstractCegarLoop]: Abstraction has 88038 states and 404604 transitions. [2019-12-07 10:45:44,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:45:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 88038 states and 404604 transitions. [2019-12-07 10:45:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:45:44,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:44,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:44,239 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:44,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:44,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1938763797, now seen corresponding path program 1 times [2019-12-07 10:45:44,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:45:44,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77682126] [2019-12-07 10:45:44,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:44,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77682126] [2019-12-07 10:45:44,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:45:44,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:45:44,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18201148] [2019-12-07 10:45:44,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:45:44,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:45:44,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:45:44,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:45:44,298 INFO L87 Difference]: Start difference. First operand 88038 states and 404604 transitions. Second operand 4 states. [2019-12-07 10:45:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:46,922 INFO L93 Difference]: Finished difference Result 136614 states and 606732 transitions. [2019-12-07 10:45:46,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:45:46,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 10:45:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:47,301 INFO L225 Difference]: With dead ends: 136614 [2019-12-07 10:45:47,301 INFO L226 Difference]: Without dead ends: 136550 [2019-12-07 10:45:47,302 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-12-07 10:45:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136550 states. [2019-12-07 10:45:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136550 to 133014. [2019-12-07 10:45:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133014 states. [2019-12-07 10:45:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133014 states to 133014 states and 593752 transitions. [2019-12-07 10:45:51,167 INFO L78 Accepts]: Start accepts. Automaton has 133014 states and 593752 transitions. Word has length 15 [2019-12-07 10:45:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:51,168 INFO L462 AbstractCegarLoop]: Abstraction has 133014 states and 593752 transitions. [2019-12-07 10:45:51,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:45:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 133014 states and 593752 transitions. [2019-12-07 10:45:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:45:51,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:51,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:51,174 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1496935772, now seen corresponding path program 1 times [2019-12-07 10:45:51,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:45:51,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085311344] [2019-12-07 10:45:51,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:51,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085311344] [2019-12-07 10:45:51,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:45:51,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:45:51,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060715398] [2019-12-07 10:45:51,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:45:51,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:45:51,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:45:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:45:51,223 INFO L87 Difference]: Start difference. First operand 133014 states and 593752 transitions. Second operand 4 states. [2019-12-07 10:45:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:52,127 INFO L93 Difference]: Finished difference Result 173334 states and 762780 transitions. [2019-12-07 10:45:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:45:52,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 10:45:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:53,005 INFO L225 Difference]: With dead ends: 173334 [2019-12-07 10:45:53,005 INFO L226 Difference]: Without dead ends: 173274 [2019-12-07 10:45:53,005 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-12-07 10:45:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173274 states. [2019-12-07 10:45:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173274 to 154858. [2019-12-07 10:45:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154858 states. [2019-12-07 10:45:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154858 states to 154858 states and 687340 transitions. [2019-12-07 10:45:59,485 INFO L78 Accepts]: Start accepts. Automaton has 154858 states and 687340 transitions. Word has length 18 [2019-12-07 10:45:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:59,485 INFO L462 AbstractCegarLoop]: Abstraction has 154858 states and 687340 transitions. [2019-12-07 10:45:59,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:45:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 154858 states and 687340 transitions. [2019-12-07 10:45:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:45:59,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:59,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:59,494 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash -839601205, now seen corresponding path program 1 times [2019-12-07 10:45:59,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:45:59,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651301809] [2019-12-07 10:45:59,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:59,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651301809] [2019-12-07 10:45:59,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:45:59,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:45:59,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985281335] [2019-12-07 10:45:59,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:45:59,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:45:59,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:45:59,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:45:59,524 INFO L87 Difference]: Start difference. First operand 154858 states and 687340 transitions. Second operand 3 states. [2019-12-07 10:46:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:00,867 INFO L93 Difference]: Finished difference Result 260150 states and 1112960 transitions. [2019-12-07 10:46:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:46:00,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 10:46:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:01,619 INFO L225 Difference]: With dead ends: 260150 [2019-12-07 10:46:01,619 INFO L226 Difference]: Without dead ends: 260150 [2019-12-07 10:46:01,619 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-12-07 10:46:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260150 states. [2019-12-07 10:46:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260150 to 230750. [2019-12-07 10:46:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230750 states. [2019-12-07 10:46:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230750 states to 230750 states and 999636 transitions. [2019-12-07 10:46:10,666 INFO L78 Accepts]: Start accepts. Automaton has 230750 states and 999636 transitions. Word has length 19 [2019-12-07 10:46:10,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:10,667 INFO L462 AbstractCegarLoop]: Abstraction has 230750 states and 999636 transitions. [2019-12-07 10:46:10,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:46:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 230750 states and 999636 transitions. [2019-12-07 10:46:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:46:10,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:10,680 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] [2019-12-07 10:46:10,680 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:10,680 INFO L82 PathProgramCache]: Analyzing trace with hash -879634023, now seen corresponding path program 1 times [2019-12-07 10:46:10,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:10,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878745830] [2019-12-07 10:46:10,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:10,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878745830] [2019-12-07 10:46:10,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:10,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:46:10,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018854372] [2019-12-07 10:46:10,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:46:10,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:46:10,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:46:10,761 INFO L87 Difference]: Start difference. First operand 230750 states and 999636 transitions. Second operand 3 states. [2019-12-07 10:46:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:12,536 INFO L93 Difference]: Finished difference Result 305787 states and 1252521 transitions. [2019-12-07 10:46:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:46:12,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 10:46:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:13,353 INFO L225 Difference]: With dead ends: 305787 [2019-12-07 10:46:13,353 INFO L226 Difference]: Without dead ends: 305208 [2019-12-07 10:46:13,353 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-12-07 10:46:16,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305208 states. [2019-12-07 10:46:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305208 to 298825. [2019-12-07 10:46:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298825 states. [2019-12-07 10:46:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298825 states to 298825 states and 1234095 transitions. [2019-12-07 10:46:24,562 INFO L78 Accepts]: Start accepts. Automaton has 298825 states and 1234095 transitions. Word has length 20 [2019-12-07 10:46:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:24,562 INFO L462 AbstractCegarLoop]: Abstraction has 298825 states and 1234095 transitions. [2019-12-07 10:46:24,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:46:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 298825 states and 1234095 transitions. [2019-12-07 10:46:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:46:24,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:24,580 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] [2019-12-07 10:46:24,580 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2110724180, now seen corresponding path program 1 times [2019-12-07 10:46:24,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:24,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943788661] [2019-12-07 10:46:24,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:24,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943788661] [2019-12-07 10:46:24,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:24,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:46:24,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556310500] [2019-12-07 10:46:24,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:46:24,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:24,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:46:24,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:46:24,624 INFO L87 Difference]: Start difference. First operand 298825 states and 1234095 transitions. Second operand 4 states. [2019-12-07 10:46:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:25,097 INFO L93 Difference]: Finished difference Result 124203 states and 419505 transitions. [2019-12-07 10:46:25,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:46:25,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 10:46:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:25,333 INFO L225 Difference]: With dead ends: 124203 [2019-12-07 10:46:25,333 INFO L226 Difference]: Without dead ends: 124203 [2019-12-07 10:46:25,333 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-12-07 10:46:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124203 states. [2019-12-07 10:46:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124203 to 124043. [2019-12-07 10:46:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124043 states. [2019-12-07 10:46:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124043 states to 124043 states and 418985 transitions. [2019-12-07 10:46:28,079 INFO L78 Accepts]: Start accepts. Automaton has 124043 states and 418985 transitions. Word has length 21 [2019-12-07 10:46:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:28,079 INFO L462 AbstractCegarLoop]: Abstraction has 124043 states and 418985 transitions. [2019-12-07 10:46:28,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:46:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 124043 states and 418985 transitions. [2019-12-07 10:46:28,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:46:28,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:28,087 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] [2019-12-07 10:46:28,087 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash 49865209, now seen corresponding path program 1 times [2019-12-07 10:46:28,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:28,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106152009] [2019-12-07 10:46:28,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:28,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106152009] [2019-12-07 10:46:28,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:28,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:46:28,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876714507] [2019-12-07 10:46:28,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:46:28,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:28,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:46:28,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:46:28,119 INFO L87 Difference]: Start difference. First operand 124043 states and 418985 transitions. Second operand 4 states. [2019-12-07 10:46:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:28,808 INFO L93 Difference]: Finished difference Result 154130 states and 513418 transitions. [2019-12-07 10:46:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:46:28,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 10:46:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:29,098 INFO L225 Difference]: With dead ends: 154130 [2019-12-07 10:46:29,098 INFO L226 Difference]: Without dead ends: 154113 [2019-12-07 10:46:29,098 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-12-07 10:46:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154113 states. [2019-12-07 10:46:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154113 to 125666. [2019-12-07 10:46:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125666 states. [2019-12-07 10:46:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125666 states to 125666 states and 424345 transitions. [2019-12-07 10:46:32,242 INFO L78 Accepts]: Start accepts. Automaton has 125666 states and 424345 transitions. Word has length 21 [2019-12-07 10:46:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:32,242 INFO L462 AbstractCegarLoop]: Abstraction has 125666 states and 424345 transitions. [2019-12-07 10:46:32,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:46:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 125666 states and 424345 transitions. [2019-12-07 10:46:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:46:32,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:32,251 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] [2019-12-07 10:46:32,251 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash 135591759, now seen corresponding path program 1 times [2019-12-07 10:46:32,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:32,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307204599] [2019-12-07 10:46:32,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:32,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307204599] [2019-12-07 10:46:32,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:32,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:46:32,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136418528] [2019-12-07 10:46:32,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:46:32,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:32,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:46:32,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:46:32,285 INFO L87 Difference]: Start difference. First operand 125666 states and 424345 transitions. Second operand 5 states. [2019-12-07 10:46:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:32,372 INFO L93 Difference]: Finished difference Result 23136 states and 69960 transitions. [2019-12-07 10:46:32,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:46:32,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:46:32,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:32,399 INFO L225 Difference]: With dead ends: 23136 [2019-12-07 10:46:32,400 INFO L226 Difference]: Without dead ends: 23136 [2019-12-07 10:46:32,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:46:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23136 states. [2019-12-07 10:46:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23136 to 19599. [2019-12-07 10:46:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19599 states. [2019-12-07 10:46:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19599 states to 19599 states and 60286 transitions. [2019-12-07 10:46:32,667 INFO L78 Accepts]: Start accepts. Automaton has 19599 states and 60286 transitions. Word has length 22 [2019-12-07 10:46:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:32,667 INFO L462 AbstractCegarLoop]: Abstraction has 19599 states and 60286 transitions. [2019-12-07 10:46:32,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:46:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 19599 states and 60286 transitions. [2019-12-07 10:46:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:46:32,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:32,902 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] [2019-12-07 10:46:32,902 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:32,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2139224125, now seen corresponding path program 1 times [2019-12-07 10:46:32,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:32,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993304202] [2019-12-07 10:46:32,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:32,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993304202] [2019-12-07 10:46:32,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:32,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:46:32,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905917058] [2019-12-07 10:46:32,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:46:32,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:32,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:46:32,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:46:32,943 INFO L87 Difference]: Start difference. First operand 19599 states and 60286 transitions. Second operand 5 states. [2019-12-07 10:46:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:33,271 INFO L93 Difference]: Finished difference Result 25652 states and 76641 transitions. [2019-12-07 10:46:33,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:46:33,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 10:46:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:33,307 INFO L225 Difference]: With dead ends: 25652 [2019-12-07 10:46:33,307 INFO L226 Difference]: Without dead ends: 25651 [2019-12-07 10:46:33,308 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-12-07 10:46:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25651 states. [2019-12-07 10:46:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25651 to 24047. [2019-12-07 10:46:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24047 states. [2019-12-07 10:46:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24047 states to 24047 states and 72843 transitions. [2019-12-07 10:46:33,638 INFO L78 Accepts]: Start accepts. Automaton has 24047 states and 72843 transitions. Word has length 34 [2019-12-07 10:46:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:33,638 INFO L462 AbstractCegarLoop]: Abstraction has 24047 states and 72843 transitions. [2019-12-07 10:46:33,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:46:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24047 states and 72843 transitions. [2019-12-07 10:46:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 10:46:33,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:33,658 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] [2019-12-07 10:46:33,658 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash -289187602, now seen corresponding path program 1 times [2019-12-07 10:46:33,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:33,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283432414] [2019-12-07 10:46:33,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:33,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283432414] [2019-12-07 10:46:33,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:33,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:46:33,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801073086] [2019-12-07 10:46:33,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:46:33,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:33,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:46:33,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:46:33,684 INFO L87 Difference]: Start difference. First operand 24047 states and 72843 transitions. Second operand 3 states. [2019-12-07 10:46:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:33,784 INFO L93 Difference]: Finished difference Result 25369 states and 73005 transitions. [2019-12-07 10:46:33,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:46:33,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 10:46:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:33,817 INFO L225 Difference]: With dead ends: 25369 [2019-12-07 10:46:33,817 INFO L226 Difference]: Without dead ends: 25369 [2019-12-07 10:46:33,818 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-12-07 10:46:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25369 states. [2019-12-07 10:46:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25369 to 23834. [2019-12-07 10:46:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23834 states. [2019-12-07 10:46:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23834 states to 23834 states and 69172 transitions. [2019-12-07 10:46:34,118 INFO L78 Accepts]: Start accepts. Automaton has 23834 states and 69172 transitions. Word has length 37 [2019-12-07 10:46:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:34,118 INFO L462 AbstractCegarLoop]: Abstraction has 23834 states and 69172 transitions. [2019-12-07 10:46:34,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:46:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23834 states and 69172 transitions. [2019-12-07 10:46:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:46:34,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:34,139 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] [2019-12-07 10:46:34,139 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:34,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:34,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1071711515, now seen corresponding path program 1 times [2019-12-07 10:46:34,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:34,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572138843] [2019-12-07 10:46:34,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:34,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572138843] [2019-12-07 10:46:34,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:34,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:46:34,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124424313] [2019-12-07 10:46:34,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:46:34,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:46:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:46:34,202 INFO L87 Difference]: Start difference. First operand 23834 states and 69172 transitions. Second operand 4 states. [2019-12-07 10:46:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:34,285 INFO L93 Difference]: Finished difference Result 25188 states and 73298 transitions. [2019-12-07 10:46:34,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:46:34,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 10:46:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:34,319 INFO L225 Difference]: With dead ends: 25188 [2019-12-07 10:46:34,319 INFO L226 Difference]: Without dead ends: 25188 [2019-12-07 10:46:34,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:46:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25188 states. [2019-12-07 10:46:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25188 to 21942. [2019-12-07 10:46:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21942 states. [2019-12-07 10:46:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21942 states to 21942 states and 65156 transitions. [2019-12-07 10:46:34,612 INFO L78 Accepts]: Start accepts. Automaton has 21942 states and 65156 transitions. Word has length 39 [2019-12-07 10:46:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:34,612 INFO L462 AbstractCegarLoop]: Abstraction has 21942 states and 65156 transitions. [2019-12-07 10:46:34,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:46:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21942 states and 65156 transitions. [2019-12-07 10:46:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:46:34,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:34,627 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] [2019-12-07 10:46:34,627 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:34,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1741884328, now seen corresponding path program 1 times [2019-12-07 10:46:34,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:34,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597510456] [2019-12-07 10:46:34,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:34,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597510456] [2019-12-07 10:46:34,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:34,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:46:34,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515051890] [2019-12-07 10:46:34,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:46:34,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:46:34,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:46:34,673 INFO L87 Difference]: Start difference. First operand 21942 states and 65156 transitions. Second operand 5 states. [2019-12-07 10:46:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:34,943 INFO L93 Difference]: Finished difference Result 23642 states and 68918 transitions. [2019-12-07 10:46:34,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:46:34,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 10:46:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:34,969 INFO L225 Difference]: With dead ends: 23642 [2019-12-07 10:46:34,970 INFO L226 Difference]: Without dead ends: 23641 [2019-12-07 10:46:34,970 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-12-07 10:46:35,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23641 states. [2019-12-07 10:46:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23641 to 19323. [2019-12-07 10:46:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19323 states. [2019-12-07 10:46:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19323 states to 19323 states and 57769 transitions. [2019-12-07 10:46:35,273 INFO L78 Accepts]: Start accepts. Automaton has 19323 states and 57769 transitions. Word has length 40 [2019-12-07 10:46:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:35,273 INFO L462 AbstractCegarLoop]: Abstraction has 19323 states and 57769 transitions. [2019-12-07 10:46:35,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:46:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19323 states and 57769 transitions. [2019-12-07 10:46:35,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:46:35,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:35,287 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, 1, 1, 1, 1, 1] [2019-12-07 10:46:35,287 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:35,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:35,288 INFO L82 PathProgramCache]: Analyzing trace with hash -816359737, now seen corresponding path program 1 times [2019-12-07 10:46:35,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:35,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806771089] [2019-12-07 10:46:35,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:35,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806771089] [2019-12-07 10:46:35,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:35,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:46:35,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843165884] [2019-12-07 10:46:35,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:46:35,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:35,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:46:35,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:46:35,341 INFO L87 Difference]: Start difference. First operand 19323 states and 57769 transitions. Second operand 5 states. [2019-12-07 10:46:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:35,657 INFO L93 Difference]: Finished difference Result 23255 states and 68034 transitions. [2019-12-07 10:46:35,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:46:35,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 10:46:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:35,682 INFO L225 Difference]: With dead ends: 23255 [2019-12-07 10:46:35,682 INFO L226 Difference]: Without dead ends: 23255 [2019-12-07 10:46:35,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-12-07 10:46:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23255 states. [2019-12-07 10:46:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23255 to 22470. [2019-12-07 10:46:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22470 states. [2019-12-07 10:46:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22470 states to 22470 states and 66245 transitions. [2019-12-07 10:46:35,950 INFO L78 Accepts]: Start accepts. Automaton has 22470 states and 66245 transitions. Word has length 47 [2019-12-07 10:46:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:35,951 INFO L462 AbstractCegarLoop]: Abstraction has 22470 states and 66245 transitions. [2019-12-07 10:46:35,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:46:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 22470 states and 66245 transitions. [2019-12-07 10:46:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 10:46:35,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:35,968 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, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:35,968 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1340023861, now seen corresponding path program 1 times [2019-12-07 10:46:35,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:35,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681406363] [2019-12-07 10:46:35,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:36,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681406363] [2019-12-07 10:46:36,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:36,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:46:36,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116667242] [2019-12-07 10:46:36,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:46:36,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:46:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:46:36,190 INFO L87 Difference]: Start difference. First operand 22470 states and 66245 transitions. Second operand 9 states. [2019-12-07 10:46:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:37,525 INFO L93 Difference]: Finished difference Result 52466 states and 138633 transitions. [2019-12-07 10:46:37,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:46:37,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-12-07 10:46:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:37,587 INFO L225 Difference]: With dead ends: 52466 [2019-12-07 10:46:37,587 INFO L226 Difference]: Without dead ends: 51672 [2019-12-07 10:46:37,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:46:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51672 states. [2019-12-07 10:46:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51672 to 29616. [2019-12-07 10:46:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29616 states. [2019-12-07 10:46:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29616 states to 29616 states and 85788 transitions. [2019-12-07 10:46:38,105 INFO L78 Accepts]: Start accepts. Automaton has 29616 states and 85788 transitions. Word has length 48 [2019-12-07 10:46:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:38,105 INFO L462 AbstractCegarLoop]: Abstraction has 29616 states and 85788 transitions. [2019-12-07 10:46:38,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:46:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 29616 states and 85788 transitions. [2019-12-07 10:46:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 10:46:38,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:38,142 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, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:38,142 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:38,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:38,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1129369211, now seen corresponding path program 2 times [2019-12-07 10:46:38,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:38,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516384953] [2019-12-07 10:46:38,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:38,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516384953] [2019-12-07 10:46:38,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:38,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:46:38,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416521167] [2019-12-07 10:46:38,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:46:38,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:38,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:46:38,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:46:38,187 INFO L87 Difference]: Start difference. First operand 29616 states and 85788 transitions. Second operand 6 states. [2019-12-07 10:46:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:38,281 INFO L93 Difference]: Finished difference Result 25298 states and 76101 transitions. [2019-12-07 10:46:38,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:46:38,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 10:46:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:38,313 INFO L225 Difference]: With dead ends: 25298 [2019-12-07 10:46:38,313 INFO L226 Difference]: Without dead ends: 24434 [2019-12-07 10:46:38,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:46:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24434 states. [2019-12-07 10:46:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24434 to 21450. [2019-12-07 10:46:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21450 states. [2019-12-07 10:46:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21450 states to 21450 states and 65781 transitions. [2019-12-07 10:46:38,666 INFO L78 Accepts]: Start accepts. Automaton has 21450 states and 65781 transitions. Word has length 48 [2019-12-07 10:46:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:38,666 INFO L462 AbstractCegarLoop]: Abstraction has 21450 states and 65781 transitions. [2019-12-07 10:46:38,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:46:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 21450 states and 65781 transitions. [2019-12-07 10:46:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 10:46:38,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:38,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:38,687 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:38,687 INFO L82 PathProgramCache]: Analyzing trace with hash -750224831, now seen corresponding path program 1 times [2019-12-07 10:46:38,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:38,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305360984] [2019-12-07 10:46:38,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:38,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305360984] [2019-12-07 10:46:38,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:38,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:46:38,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080871807] [2019-12-07 10:46:38,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:46:38,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:38,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:46:38,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:46:38,775 INFO L87 Difference]: Start difference. First operand 21450 states and 65781 transitions. Second operand 7 states. [2019-12-07 10:46:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:39,122 INFO L93 Difference]: Finished difference Result 54503 states and 164777 transitions. [2019-12-07 10:46:39,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:46:39,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-07 10:46:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:39,173 INFO L225 Difference]: With dead ends: 54503 [2019-12-07 10:46:39,173 INFO L226 Difference]: Without dead ends: 37480 [2019-12-07 10:46:39,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:46:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37480 states. [2019-12-07 10:46:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37480 to 28118. [2019-12-07 10:46:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28118 states. [2019-12-07 10:46:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28118 states to 28118 states and 84041 transitions. [2019-12-07 10:46:39,624 INFO L78 Accepts]: Start accepts. Automaton has 28118 states and 84041 transitions. Word has length 64 [2019-12-07 10:46:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:39,624 INFO L462 AbstractCegarLoop]: Abstraction has 28118 states and 84041 transitions. [2019-12-07 10:46:39,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:46:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 28118 states and 84041 transitions. [2019-12-07 10:46:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:46:39,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:39,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:39,654 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:39,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash 669734162, now seen corresponding path program 1 times [2019-12-07 10:46:39,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:39,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311637439] [2019-12-07 10:46:39,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:39,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311637439] [2019-12-07 10:46:39,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:39,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:46:39,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384268397] [2019-12-07 10:46:39,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:46:39,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:39,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:46:39,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:46:39,728 INFO L87 Difference]: Start difference. First operand 28118 states and 84041 transitions. Second operand 7 states. [2019-12-07 10:46:40,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:40,184 INFO L93 Difference]: Finished difference Result 59352 states and 171332 transitions. [2019-12-07 10:46:40,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:46:40,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 10:46:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:40,257 INFO L225 Difference]: With dead ends: 59352 [2019-12-07 10:46:40,257 INFO L226 Difference]: Without dead ends: 56522 [2019-12-07 10:46:40,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:46:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56522 states. [2019-12-07 10:46:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56522 to 37081. [2019-12-07 10:46:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37081 states. [2019-12-07 10:46:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37081 states to 37081 states and 111865 transitions. [2019-12-07 10:46:40,999 INFO L78 Accepts]: Start accepts. Automaton has 37081 states and 111865 transitions. Word has length 65 [2019-12-07 10:46:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:41,000 INFO L462 AbstractCegarLoop]: Abstraction has 37081 states and 111865 transitions. [2019-12-07 10:46:41,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:46:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 37081 states and 111865 transitions. [2019-12-07 10:46:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:46:41,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:41,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:41,036 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1378277650, now seen corresponding path program 2 times [2019-12-07 10:46:41,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:41,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928855560] [2019-12-07 10:46:41,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:41,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928855560] [2019-12-07 10:46:41,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:41,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:46:41,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039007950] [2019-12-07 10:46:41,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:46:41,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:41,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:46:41,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:46:41,075 INFO L87 Difference]: Start difference. First operand 37081 states and 111865 transitions. Second operand 4 states. [2019-12-07 10:46:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:41,181 INFO L93 Difference]: Finished difference Result 40608 states and 120706 transitions. [2019-12-07 10:46:41,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:46:41,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 10:46:41,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:41,204 INFO L225 Difference]: With dead ends: 40608 [2019-12-07 10:46:41,204 INFO L226 Difference]: Without dead ends: 16512 [2019-12-07 10:46:41,204 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-12-07 10:46:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16512 states. [2019-12-07 10:46:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16512 to 16512. [2019-12-07 10:46:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16512 states. [2019-12-07 10:46:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16512 states to 16512 states and 46518 transitions. [2019-12-07 10:46:41,398 INFO L78 Accepts]: Start accepts. Automaton has 16512 states and 46518 transitions. Word has length 65 [2019-12-07 10:46:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:41,398 INFO L462 AbstractCegarLoop]: Abstraction has 16512 states and 46518 transitions. [2019-12-07 10:46:41,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:46:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 16512 states and 46518 transitions. [2019-12-07 10:46:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:46:41,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:41,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:41,412 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1658799206, now seen corresponding path program 3 times [2019-12-07 10:46:41,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:41,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797360027] [2019-12-07 10:46:41,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:41,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797360027] [2019-12-07 10:46:41,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:41,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:46:41,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559463099] [2019-12-07 10:46:41,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:46:41,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:41,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:46:41,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:46:41,442 INFO L87 Difference]: Start difference. First operand 16512 states and 46518 transitions. Second operand 3 states. [2019-12-07 10:46:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:41,485 INFO L93 Difference]: Finished difference Result 18013 states and 49643 transitions. [2019-12-07 10:46:41,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:46:41,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 10:46:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:41,497 INFO L225 Difference]: With dead ends: 18013 [2019-12-07 10:46:41,497 INFO L226 Difference]: Without dead ends: 11396 [2019-12-07 10:46:41,497 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-12-07 10:46:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11396 states. [2019-12-07 10:46:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11396 to 11396. [2019-12-07 10:46:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11396 states. [2019-12-07 10:46:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11396 states to 11396 states and 28621 transitions. [2019-12-07 10:46:41,624 INFO L78 Accepts]: Start accepts. Automaton has 11396 states and 28621 transitions. Word has length 65 [2019-12-07 10:46:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:41,624 INFO L462 AbstractCegarLoop]: Abstraction has 11396 states and 28621 transitions. [2019-12-07 10:46:41,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:46:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 11396 states and 28621 transitions. [2019-12-07 10:46:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:46:41,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:41,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:41,633 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:41,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:41,633 INFO L82 PathProgramCache]: Analyzing trace with hash 85165569, now seen corresponding path program 1 times [2019-12-07 10:46:41,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:41,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662500765] [2019-12-07 10:46:41,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:41,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662500765] [2019-12-07 10:46:41,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:41,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:46:41,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365661208] [2019-12-07 10:46:41,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:46:41,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:41,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:46:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:46:41,692 INFO L87 Difference]: Start difference. First operand 11396 states and 28621 transitions. Second operand 4 states. [2019-12-07 10:46:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:41,744 INFO L93 Difference]: Finished difference Result 12279 states and 30454 transitions. [2019-12-07 10:46:41,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:46:41,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 10:46:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:41,752 INFO L225 Difference]: With dead ends: 12279 [2019-12-07 10:46:41,752 INFO L226 Difference]: Without dead ends: 8786 [2019-12-07 10:46:41,753 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-12-07 10:46:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8786 states. [2019-12-07 10:46:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8786 to 8044. [2019-12-07 10:46:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8044 states. [2019-12-07 10:46:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8044 states to 8044 states and 20285 transitions. [2019-12-07 10:46:41,840 INFO L78 Accepts]: Start accepts. Automaton has 8044 states and 20285 transitions. Word has length 65 [2019-12-07 10:46:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:41,841 INFO L462 AbstractCegarLoop]: Abstraction has 8044 states and 20285 transitions. [2019-12-07 10:46:41,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:46:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 8044 states and 20285 transitions. [2019-12-07 10:46:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:46:41,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:41,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:41,847 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2063420506, now seen corresponding path program 4 times [2019-12-07 10:46:41,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:41,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870926683] [2019-12-07 10:46:41,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:41,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870926683] [2019-12-07 10:46:41,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:41,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:46:41,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500037370] [2019-12-07 10:46:41,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:46:41,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:41,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:46:41,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:46:41,908 INFO L87 Difference]: Start difference. First operand 8044 states and 20285 transitions. Second operand 5 states. [2019-12-07 10:46:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:41,958 INFO L93 Difference]: Finished difference Result 8858 states and 21940 transitions. [2019-12-07 10:46:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:46:41,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 10:46:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:41,959 INFO L225 Difference]: With dead ends: 8858 [2019-12-07 10:46:41,959 INFO L226 Difference]: Without dead ends: 931 [2019-12-07 10:46:41,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:46:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-07 10:46:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2019-12-07 10:46:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-07 10:46:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1845 transitions. [2019-12-07 10:46:41,967 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1845 transitions. Word has length 65 [2019-12-07 10:46:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:41,967 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1845 transitions. [2019-12-07 10:46:41,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:46:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1845 transitions. [2019-12-07 10:46:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:46:41,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:41,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:41,968 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:41,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:41,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1820368900, now seen corresponding path program 5 times [2019-12-07 10:46:41,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:41,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812563243] [2019-12-07 10:46:41,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:42,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812563243] [2019-12-07 10:46:42,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:42,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:46:42,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365245430] [2019-12-07 10:46:42,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:46:42,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:42,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:46:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:46:42,097 INFO L87 Difference]: Start difference. First operand 931 states and 1845 transitions. Second operand 10 states. [2019-12-07 10:46:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:42,552 INFO L93 Difference]: Finished difference Result 1490 states and 2859 transitions. [2019-12-07 10:46:42,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:46:42,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-07 10:46:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:42,554 INFO L225 Difference]: With dead ends: 1490 [2019-12-07 10:46:42,554 INFO L226 Difference]: Without dead ends: 1490 [2019-12-07 10:46:42,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:46:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2019-12-07 10:46:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 969. [2019-12-07 10:46:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-12-07 10:46:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1909 transitions. [2019-12-07 10:46:42,563 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1909 transitions. Word has length 65 [2019-12-07 10:46:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:42,564 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1909 transitions. [2019-12-07 10:46:42,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:46:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1909 transitions. [2019-12-07 10:46:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:46:42,564 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:42,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:42,565 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:42,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:42,565 INFO L82 PathProgramCache]: Analyzing trace with hash -276182642, now seen corresponding path program 6 times [2019-12-07 10:46:42,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:42,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447743582] [2019-12-07 10:46:42,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:42,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447743582] [2019-12-07 10:46:42,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:42,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:46:42,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008148961] [2019-12-07 10:46:42,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:46:42,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:42,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:46:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:46:42,598 INFO L87 Difference]: Start difference. First operand 969 states and 1909 transitions. Second operand 3 states. [2019-12-07 10:46:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:42,606 INFO L93 Difference]: Finished difference Result 968 states and 1907 transitions. [2019-12-07 10:46:42,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:46:42,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 10:46:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:42,608 INFO L225 Difference]: With dead ends: 968 [2019-12-07 10:46:42,608 INFO L226 Difference]: Without dead ends: 968 [2019-12-07 10:46:42,608 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-12-07 10:46:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-12-07 10:46:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 850. [2019-12-07 10:46:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-12-07 10:46:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1689 transitions. [2019-12-07 10:46:42,618 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1689 transitions. Word has length 65 [2019-12-07 10:46:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:42,618 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1689 transitions. [2019-12-07 10:46:42,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:46:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1689 transitions. [2019-12-07 10:46:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:46:42,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:42,619 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, 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-12-07 10:46:42,619 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1474232984, now seen corresponding path program 1 times [2019-12-07 10:46:42,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:42,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565798784] [2019-12-07 10:46:42,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:46:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:46:42,722 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:46:42,722 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:46:42,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= v_~weak$$choice2~0_289 0) (= v_~z$r_buff0_thd0~0_178 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44|) 0) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44| 1)) (= 0 v_~z$r_buff1_thd3~0_386) (= v_~z~0_311 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_71) (= v_~__unbuffered_cnt~0_176 0) (= v_~main$tmp_guard0~0_25 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff0_thd2~0_95 0) (= v_~z$read_delayed_var~0.base_5 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t357~0.base_44|) (= v_~__unbuffered_p1_EBX~0_70 0) (= 0 v_~z$mem_tmp~0_209) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff1_thd1~0_163 0) (= v_~z$w_buff0~0_362 0) (= 0 v_~z$r_buff0_thd4~0_531) (= v_~z$r_buff0_thd1~0_95 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_196) (= 0 v_~z$flush_delayed~0_243) (= 0 v_~__unbuffered_p3_EBX~0_64) (= v_~z$w_buff0_used~0_937 0) (= 0 v_~__unbuffered_p2_EAX~0_86) (= v_~z$r_buff1_thd2~0_163 0) (= 0 |v_ULTIMATE.start_main_~#t357~0.offset_28|) (= v_~z$w_buff1~0_247 0) (= 0 v_~z$r_buff0_thd3~0_403) (= v_~a~0_42 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t357~0.base_44| 4)) (= v_~z$w_buff1_used~0_682 0) (= v_~y~0_58 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44|) |v_ULTIMATE.start_main_~#t357~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$r_buff1_thd0~0_268 0) (= v_~main$tmp_guard1~0_55 0) (= 0 v_~z$r_buff1_thd4~0_339) (= v_~x~0_88 0) (= 0 v_~__unbuffered_p3_EAX~0_71))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_163, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ~a~0=v_~a~0_42, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_178, ULTIMATE.start_main_~#t357~0.offset=|v_ULTIMATE.start_main_~#t357~0.offset_28|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_531, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_71, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~z$mem_tmp~0=v_~z$mem_tmp~0_209, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_682, ~z$flush_delayed~0=v_~z$flush_delayed~0_243, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_196, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_202|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_403, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_176, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_339, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_247, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_55, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_18|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_268, ULTIMATE.start_main_~#t357~0.base=|v_ULTIMATE.start_main_~#t357~0.base_44|, ~y~0=v_~y~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_937, ~z$w_buff0~0=v_~z$w_buff0~0_362, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_386, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_64, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_84|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_106|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_36|, ~z~0=v_~z~0_311, ~weak$$choice2~0=v_~weak$$choice2~0_289, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_95} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t357~0.offset, ULTIMATE.start_main_~#t359~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t358~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_~#t360~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t357~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t359~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t358~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:46:42,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L856-1-->L858: Formula: (and (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11| 1) |v_#valid_48|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t358~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t358~0.base_11| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11|) |v_ULTIMATE.start_main_~#t358~0.offset_10| 1)) |v_#memory_int_21|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t358~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t358~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t358~0.base] because there is no mapped edge [2019-12-07 10:46:42,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12| 1) |v_#valid_46|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t359~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t359~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t359~0.offset_11|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t359~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12|) |v_ULTIMATE.start_main_~#t359~0.offset_11| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_12|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_11|, #valid=|v_#valid_46|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t359~0.base, ULTIMATE.start_main_~#t359~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 10:46:42,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L860-1-->L862: Formula: (and (= |v_ULTIMATE.start_main_~#t360~0.offset_11| 0) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t360~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t360~0.base_13| 0)) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t360~0.base_13|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13|) |v_ULTIMATE.start_main_~#t360~0.offset_11| 3)) |v_#memory_int_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t360~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:46:42,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_6| v_P3Thread1of1ForFork2_~arg.offset_4) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_90 1) (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_19) (= v_~z$w_buff0_used~0_91 v_~z$w_buff1_used~0_52) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_90 256))) (not (= 0 (mod v_~z$w_buff1_used~0_52 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= v_P3Thread1of1ForFork2_~arg.base_4 |v_P3Thread1of1ForFork2_#in~arg.base_6|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_4, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_52, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, ~z$w_buff1~0=v_~z$w_buff1~0_19, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_4, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 10:46:42,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L818-2-->L818-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out-1728739566| |P3Thread1of1ForFork2_#t~ite28_Out-1728739566|)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1728739566 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1728739566 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1728739566| ~z$w_buff0~0_In-1728739566) (not .cse0) (not .cse1) .cse2) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1728739566| ~z$w_buff1~0_In-1728739566) .cse2 (or .cse1 .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1728739566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1728739566, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1728739566, ~z$w_buff1~0=~z$w_buff1~0_In-1728739566} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1728739566|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1728739566|, ~z$w_buff0~0=~z$w_buff0~0_In-1728739566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1728739566, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1728739566, ~z$w_buff1~0=~z$w_buff1~0_In-1728739566} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 10:46:42,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_102 v_~z$r_buff0_thd4~0_101) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 10:46:42,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1189791159 256)))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out1189791159| ~z~0_In1189791159)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1189791159| ~z$mem_tmp~0_In1189791159) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1189791159, ~z$flush_delayed~0=~z$flush_delayed~0_In1189791159, ~z~0=~z~0_In1189791159} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1189791159, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1189791159|, ~z$flush_delayed~0=~z$flush_delayed~0_In1189791159, ~z~0=~z~0_In1189791159} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 10:46:42,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~a~0_15 1) (= v_~x~0_24 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 10:46:42,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~__unbuffered_p1_EBX~0_22 v_~y~0_39) (= v_~x~0_28 2) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~x~0_28 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~y~0=v_~y~0_39} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 10:46:42,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In22108142 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out22108142| ~z~0_In22108142)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out22108142| ~z$mem_tmp~0_In22108142)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In22108142, ~z$flush_delayed~0=~z$flush_delayed~0_In22108142, ~z~0=~z~0_In22108142} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In22108142, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out22108142|, ~z$flush_delayed~0=~z$flush_delayed~0_In22108142, ~z~0=~z~0_In22108142} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 10:46:42,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In371353585 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In371353585 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out371353585| 0) (not .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite51_Out371353585| ~z$w_buff0_used~0_In371353585) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In371353585, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In371353585} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out371353585|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In371353585, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In371353585} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 10:46:42,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-620042355 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-620042355 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-620042355 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-620042355 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-620042355| ~z$w_buff1_used~0_In-620042355)) (and (= |P3Thread1of1ForFork2_#t~ite52_Out-620042355| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-620042355, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620042355, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-620042355, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-620042355} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-620042355|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-620042355, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620042355, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-620042355, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-620042355} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 10:46:42,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L836-->L837: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-254930603 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-254930603 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_In-254930603 ~z$r_buff0_thd4~0_Out-254930603))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~z$r_buff0_thd4~0_Out-254930603)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-254930603, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-254930603} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-254930603|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-254930603, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-254930603} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 10:46:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-224597408 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-224597408 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-224597408 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-224597408 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-224597408| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out-224597408| ~z$r_buff1_thd4~0_In-224597408)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-224597408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-224597408, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-224597408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-224597408} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-224597408|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-224597408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-224597408, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-224597408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-224597408} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 10:46:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L837-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P3Thread1of1ForFork2_#t~ite54_42| v_~z$r_buff1_thd4~0_264) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_41|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_264, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:46:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_182) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_183 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~z$flush_delayed~0=v_~z$flush_delayed~0_182, ~z~0=v_~z~0_183, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 10:46:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L862-1-->L868: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_26) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:46:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L868-2-->L868-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1393671162 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1393671162 256)))) (or (and (= ~z~0_In-1393671162 |ULTIMATE.start_main_#t~ite59_Out-1393671162|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1393671162 |ULTIMATE.start_main_#t~ite59_Out-1393671162|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1393671162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393671162, ~z$w_buff1~0=~z$w_buff1~0_In-1393671162, ~z~0=~z~0_In-1393671162} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1393671162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393671162, ~z$w_buff1~0=~z$w_buff1~0_In-1393671162, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1393671162|, ~z~0=~z~0_In-1393671162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:46:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L868-4-->L869: Formula: (= v_~z~0_104 |v_ULTIMATE.start_main_#t~ite59_32|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_32|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_31|, ~z~0=v_~z~0_104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 10:46:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L869-->L869-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1567226141 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1567226141 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1567226141| ~z$w_buff0_used~0_In1567226141)) (and (= |ULTIMATE.start_main_#t~ite61_Out1567226141| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1567226141, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567226141} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1567226141, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1567226141|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567226141} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:46:42,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L870-->L870-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-2002342313 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2002342313 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2002342313 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2002342313 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-2002342313| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out-2002342313| ~z$w_buff1_used~0_In-2002342313) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2002342313, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002342313, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2002342313, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002342313} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2002342313|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2002342313, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002342313, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2002342313, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002342313} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:46:42,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In906707906 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In906707906 256)))) (or (and (= ~z$r_buff0_thd0~0_In906707906 |ULTIMATE.start_main_#t~ite63_Out906707906|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out906707906| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In906707906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In906707906} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out906707906|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In906707906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In906707906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:46:42,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L872-->L872-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1617651384 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1617651384 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1617651384 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1617651384 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out1617651384|)) (and (= |ULTIMATE.start_main_#t~ite64_Out1617651384| ~z$r_buff1_thd0~0_In1617651384) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1617651384, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1617651384, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1617651384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1617651384} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1617651384, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1617651384, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1617651384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1617651384, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1617651384|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 10:46:42,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_44 2) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 1 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p3_EBX~0_28))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_21 256)) (= v_~z$r_buff1_thd0~0_227 |v_ULTIMATE.start_main_#t~ite64_49|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_49|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_48|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:46:42,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:46:42 BasicIcfg [2019-12-07 10:46:42,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:46:42,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:46:42,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:46:42,819 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:46:42,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:45:27" (3/4) ... [2019-12-07 10:46:42,821 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:46:42,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= v_~weak$$choice2~0_289 0) (= v_~z$r_buff0_thd0~0_178 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44|) 0) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44| 1)) (= 0 v_~z$r_buff1_thd3~0_386) (= v_~z~0_311 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_71) (= v_~__unbuffered_cnt~0_176 0) (= v_~main$tmp_guard0~0_25 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff0_thd2~0_95 0) (= v_~z$read_delayed_var~0.base_5 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t357~0.base_44|) (= v_~__unbuffered_p1_EBX~0_70 0) (= 0 v_~z$mem_tmp~0_209) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff1_thd1~0_163 0) (= v_~z$w_buff0~0_362 0) (= 0 v_~z$r_buff0_thd4~0_531) (= v_~z$r_buff0_thd1~0_95 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_196) (= 0 v_~z$flush_delayed~0_243) (= 0 v_~__unbuffered_p3_EBX~0_64) (= v_~z$w_buff0_used~0_937 0) (= 0 v_~__unbuffered_p2_EAX~0_86) (= v_~z$r_buff1_thd2~0_163 0) (= 0 |v_ULTIMATE.start_main_~#t357~0.offset_28|) (= v_~z$w_buff1~0_247 0) (= 0 v_~z$r_buff0_thd3~0_403) (= v_~a~0_42 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t357~0.base_44| 4)) (= v_~z$w_buff1_used~0_682 0) (= v_~y~0_58 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44|) |v_ULTIMATE.start_main_~#t357~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$r_buff1_thd0~0_268 0) (= v_~main$tmp_guard1~0_55 0) (= 0 v_~z$r_buff1_thd4~0_339) (= v_~x~0_88 0) (= 0 v_~__unbuffered_p3_EAX~0_71))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_163, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ~a~0=v_~a~0_42, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_178, ULTIMATE.start_main_~#t357~0.offset=|v_ULTIMATE.start_main_~#t357~0.offset_28|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_531, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_71, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~z$mem_tmp~0=v_~z$mem_tmp~0_209, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_682, ~z$flush_delayed~0=v_~z$flush_delayed~0_243, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_196, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_202|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_403, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_176, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_339, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_247, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_55, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_18|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_268, ULTIMATE.start_main_~#t357~0.base=|v_ULTIMATE.start_main_~#t357~0.base_44|, ~y~0=v_~y~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_937, ~z$w_buff0~0=v_~z$w_buff0~0_362, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_386, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_64, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_84|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_106|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_36|, ~z~0=v_~z~0_311, ~weak$$choice2~0=v_~weak$$choice2~0_289, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_95} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t357~0.offset, ULTIMATE.start_main_~#t359~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t358~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_~#t360~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t357~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t359~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t358~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:46:42,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L856-1-->L858: Formula: (and (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11| 1) |v_#valid_48|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t358~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t358~0.base_11| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11|) |v_ULTIMATE.start_main_~#t358~0.offset_10| 1)) |v_#memory_int_21|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t358~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t358~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t358~0.base] because there is no mapped edge [2019-12-07 10:46:42,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12| 1) |v_#valid_46|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t359~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t359~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t359~0.offset_11|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t359~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12|) |v_ULTIMATE.start_main_~#t359~0.offset_11| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_12|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_11|, #valid=|v_#valid_46|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t359~0.base, ULTIMATE.start_main_~#t359~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 10:46:42,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L860-1-->L862: Formula: (and (= |v_ULTIMATE.start_main_~#t360~0.offset_11| 0) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t360~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t360~0.base_13| 0)) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t360~0.base_13|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13|) |v_ULTIMATE.start_main_~#t360~0.offset_11| 3)) |v_#memory_int_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t360~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:46:42,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_6| v_P3Thread1of1ForFork2_~arg.offset_4) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_90 1) (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_19) (= v_~z$w_buff0_used~0_91 v_~z$w_buff1_used~0_52) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_90 256))) (not (= 0 (mod v_~z$w_buff1_used~0_52 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= v_P3Thread1of1ForFork2_~arg.base_4 |v_P3Thread1of1ForFork2_#in~arg.base_6|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_4, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_52, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, ~z$w_buff1~0=v_~z$w_buff1~0_19, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_4, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 10:46:42,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L818-2-->L818-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out-1728739566| |P3Thread1of1ForFork2_#t~ite28_Out-1728739566|)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1728739566 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1728739566 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1728739566| ~z$w_buff0~0_In-1728739566) (not .cse0) (not .cse1) .cse2) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1728739566| ~z$w_buff1~0_In-1728739566) .cse2 (or .cse1 .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1728739566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1728739566, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1728739566, ~z$w_buff1~0=~z$w_buff1~0_In-1728739566} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1728739566|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1728739566|, ~z$w_buff0~0=~z$w_buff0~0_In-1728739566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1728739566, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1728739566, ~z$w_buff1~0=~z$w_buff1~0_In-1728739566} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 10:46:42,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_102 v_~z$r_buff0_thd4~0_101) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 10:46:42,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1189791159 256)))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out1189791159| ~z~0_In1189791159)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1189791159| ~z$mem_tmp~0_In1189791159) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1189791159, ~z$flush_delayed~0=~z$flush_delayed~0_In1189791159, ~z~0=~z~0_In1189791159} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1189791159, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1189791159|, ~z$flush_delayed~0=~z$flush_delayed~0_In1189791159, ~z~0=~z~0_In1189791159} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 10:46:42,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~a~0_15 1) (= v_~x~0_24 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 10:46:42,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~__unbuffered_p1_EBX~0_22 v_~y~0_39) (= v_~x~0_28 2) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~x~0_28 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~y~0=v_~y~0_39} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 10:46:42,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In22108142 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out22108142| ~z~0_In22108142)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out22108142| ~z$mem_tmp~0_In22108142)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In22108142, ~z$flush_delayed~0=~z$flush_delayed~0_In22108142, ~z~0=~z~0_In22108142} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In22108142, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out22108142|, ~z$flush_delayed~0=~z$flush_delayed~0_In22108142, ~z~0=~z~0_In22108142} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 10:46:42,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In371353585 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In371353585 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out371353585| 0) (not .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite51_Out371353585| ~z$w_buff0_used~0_In371353585) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In371353585, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In371353585} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out371353585|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In371353585, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In371353585} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 10:46:42,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-620042355 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-620042355 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-620042355 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-620042355 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-620042355| ~z$w_buff1_used~0_In-620042355)) (and (= |P3Thread1of1ForFork2_#t~ite52_Out-620042355| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-620042355, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620042355, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-620042355, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-620042355} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-620042355|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-620042355, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620042355, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-620042355, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-620042355} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 10:46:42,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L836-->L837: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-254930603 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-254930603 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_In-254930603 ~z$r_buff0_thd4~0_Out-254930603))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~z$r_buff0_thd4~0_Out-254930603)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-254930603, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-254930603} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-254930603|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-254930603, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-254930603} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 10:46:42,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-224597408 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-224597408 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-224597408 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-224597408 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-224597408| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out-224597408| ~z$r_buff1_thd4~0_In-224597408)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-224597408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-224597408, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-224597408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-224597408} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-224597408|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-224597408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-224597408, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-224597408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-224597408} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 10:46:42,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L837-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P3Thread1of1ForFork2_#t~ite54_42| v_~z$r_buff1_thd4~0_264) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_41|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_264, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:46:42,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_182) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_183 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~z$flush_delayed~0=v_~z$flush_delayed~0_182, ~z~0=v_~z~0_183, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 10:46:42,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L862-1-->L868: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_26) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:46:42,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L868-2-->L868-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1393671162 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1393671162 256)))) (or (and (= ~z~0_In-1393671162 |ULTIMATE.start_main_#t~ite59_Out-1393671162|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1393671162 |ULTIMATE.start_main_#t~ite59_Out-1393671162|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1393671162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393671162, ~z$w_buff1~0=~z$w_buff1~0_In-1393671162, ~z~0=~z~0_In-1393671162} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1393671162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393671162, ~z$w_buff1~0=~z$w_buff1~0_In-1393671162, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1393671162|, ~z~0=~z~0_In-1393671162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:46:42,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L868-4-->L869: Formula: (= v_~z~0_104 |v_ULTIMATE.start_main_#t~ite59_32|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_32|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_31|, ~z~0=v_~z~0_104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 10:46:42,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L869-->L869-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1567226141 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1567226141 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1567226141| ~z$w_buff0_used~0_In1567226141)) (and (= |ULTIMATE.start_main_#t~ite61_Out1567226141| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1567226141, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567226141} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1567226141, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1567226141|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567226141} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:46:42,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L870-->L870-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-2002342313 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2002342313 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2002342313 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2002342313 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-2002342313| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out-2002342313| ~z$w_buff1_used~0_In-2002342313) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2002342313, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002342313, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2002342313, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002342313} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2002342313|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2002342313, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002342313, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2002342313, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002342313} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:46:42,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In906707906 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In906707906 256)))) (or (and (= ~z$r_buff0_thd0~0_In906707906 |ULTIMATE.start_main_#t~ite63_Out906707906|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out906707906| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In906707906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In906707906} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out906707906|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In906707906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In906707906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:46:42,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L872-->L872-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1617651384 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1617651384 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1617651384 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1617651384 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out1617651384|)) (and (= |ULTIMATE.start_main_#t~ite64_Out1617651384| ~z$r_buff1_thd0~0_In1617651384) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1617651384, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1617651384, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1617651384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1617651384} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1617651384, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1617651384, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1617651384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1617651384, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1617651384|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 10:46:42,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_44 2) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 1 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p3_EBX~0_28))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_21 256)) (= v_~z$r_buff1_thd0~0_227 |v_ULTIMATE.start_main_#t~ite64_49|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_49|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_48|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:46:42,900 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_468b6c7b-aa87-4286-84f4-b401fa23cd30/bin/uautomizer/witness.graphml [2019-12-07 10:46:42,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:46:42,901 INFO L168 Benchmark]: Toolchain (without parser) took 76838.87 ms. Allocated memory was 1.0 GB in the beginning and 7.7 GB in the end (delta: 6.7 GB). Free memory was 937.1 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2019-12-07 10:46:42,901 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:46:42,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:46:42,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.08 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-12-07 10:46:42,902 INFO L168 Benchmark]: Boogie Preprocessor took 28.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:46:42,902 INFO L168 Benchmark]: RCFGBuilder took 467.71 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: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:46:42,902 INFO L168 Benchmark]: TraceAbstraction took 75805.02 ms. Allocated memory was 1.2 GB in the beginning and 7.7 GB in the end (delta: 6.6 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2019-12-07 10:46:42,903 INFO L168 Benchmark]: Witness Printer took 80.61 ms. Allocated memory is still 7.7 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:46:42,904 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 412.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.08 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. * Boogie Preprocessor took 28.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 467.71 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: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75805.02 ms. Allocated memory was 1.2 GB in the beginning and 7.7 GB in the end (delta: 6.6 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 80.61 ms. Allocated memory is still 7.7 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 212 ProgramPointsBefore, 114 ProgramPointsAfterwards, 255 TransitionsBefore, 134 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11004 VarBasedMoverChecksPositive, 332 VarBasedMoverChecksNegative, 88 SemBasedMoverChecksPositive, 353 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 147467 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 y = 1 [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 75.6s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4955 SDtfs, 6330 SDslu, 9821 SDs, 0 SdLazy, 3858 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298825occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 156591 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1023 NumberOfCodeBlocks, 1023 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 934 ConstructedInterpolants, 0 QuantifiedInterpolants, 289630 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...