./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_rmo.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_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/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 668f1f7415cf64edf86405d17a6c6dcb0d5f059f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:52:17,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:52:17,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:52:17,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:52:17,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:52:17,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:52:17,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:52:17,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:52:17,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:52:17,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:52:17,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:52:17,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:52:17,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:52:17,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:52:17,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:52:17,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:52:17,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:52:17,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:52:17,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:52:17,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:52:17,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:52:17,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:52:17,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:52:17,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:52:17,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:52:17,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:52:17,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:52:17,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:52:17,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:52:17,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:52:17,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:52:17,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:52:17,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:52:17,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:52:17,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:52:17,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:52:17,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:52:17,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:52:17,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:52:17,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:52:17,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:52:17,116 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:52:17,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:52:17,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:52:17,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:52:17,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:52:17,128 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:52:17,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:52:17,128 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:52:17,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:52:17,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:52:17,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:52:17,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:52:17,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:52:17,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:52:17,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:52:17,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:52:17,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:52:17,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:52:17,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:52:17,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:52:17,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:52:17,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:52:17,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:52:17,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:52:17,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:52:17,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:52:17,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:52:17,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:52:17,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:52:17,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:52:17,132 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_b01a628f-af77-4714-85a9-49a4655ae369/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 -> 668f1f7415cf64edf86405d17a6c6dcb0d5f059f [2019-12-07 17:52:17,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:52:17,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:52:17,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:52:17,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:52:17,251 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:52:17,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe005_rmo.opt.i [2019-12-07 17:52:17,287 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/data/d8efd25fc/f196d1659b2649caa971e05c98a99102/FLAG8767bff11 [2019-12-07 17:52:17,639 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:52:17,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/sv-benchmarks/c/pthread-wmm/safe005_rmo.opt.i [2019-12-07 17:52:17,650 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/data/d8efd25fc/f196d1659b2649caa971e05c98a99102/FLAG8767bff11 [2019-12-07 17:52:17,659 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/data/d8efd25fc/f196d1659b2649caa971e05c98a99102 [2019-12-07 17:52:17,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:52:17,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:52:17,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:52:17,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:52:17,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:52:17,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:52:17" (1/1) ... [2019-12-07 17:52:17,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d5c54a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:17, skipping insertion in model container [2019-12-07 17:52:17,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:52:17" (1/1) ... [2019-12-07 17:52:17,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:52:17,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:52:17,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:52:17,968 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:52:18,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:52:18,056 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:52:18,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18 WrapperNode [2019-12-07 17:52:18,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:52:18,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:52:18,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:52:18,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:52:18,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... [2019-12-07 17:52:18,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... [2019-12-07 17:52:18,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:52:18,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:52:18,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:52:18,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:52:18,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... [2019-12-07 17:52:18,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... [2019-12-07 17:52:18,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... [2019-12-07 17:52:18,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... [2019-12-07 17:52:18,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... [2019-12-07 17:52:18,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... [2019-12-07 17:52:18,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... [2019-12-07 17:52:18,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:52:18,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:52:18,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:52:18,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:52:18,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/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 17:52:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:52:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:52:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:52:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:52:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:52:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:52:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:52:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:52:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:52:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:52:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:52:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:52:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:52:18,166 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 17:52:18,509 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:52:18,510 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:52:18,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:52:18 BoogieIcfgContainer [2019-12-07 17:52:18,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:52:18,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:52:18,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:52:18,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:52:18,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:52:17" (1/3) ... [2019-12-07 17:52:18,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f33ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:52:18, skipping insertion in model container [2019-12-07 17:52:18,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:52:18" (2/3) ... [2019-12-07 17:52:18,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f33ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:52:18, skipping insertion in model container [2019-12-07 17:52:18,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:52:18" (3/3) ... [2019-12-07 17:52:18,516 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_rmo.opt.i [2019-12-07 17:52:18,523 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:52:18,523 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:52:18,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:52:18,528 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:52:18,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,573 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,573 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:52:18,592 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:52:18,604 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:52:18,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:52:18,605 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:52:18,605 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:52:18,605 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:52:18,605 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:52:18,605 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:52:18,605 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:52:18,615 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 17:52:18,617 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 17:52:18,668 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 17:52:18,669 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:52:18,678 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 17:52:18,691 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 17:52:18,725 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 17:52:18,725 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:52:18,732 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 17:52:18,748 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 17:52:18,749 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:52:21,771 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 17:52:21,915 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-07 17:52:21,915 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 17:52:21,917 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 17:52:31,143 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-07 17:52:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-07 17:52:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:52:31,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:31,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:52:31,149 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:31,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-07 17:52:31,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:31,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008753221] [2019-12-07 17:52:31,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:31,314 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 17:52:31,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008753221] [2019-12-07 17:52:31,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:31,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:52:31,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004231269] [2019-12-07 17:52:31,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:52:31,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:52:31,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:52:31,329 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-07 17:52:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:31,911 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-07 17:52:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:52:31,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 17:52:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:32,443 INFO L225 Difference]: With dead ends: 85012 [2019-12-07 17:52:32,443 INFO L226 Difference]: Without dead ends: 80140 [2019-12-07 17:52:32,444 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 17:52:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-07 17:52:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-07 17:52:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-07 17:52:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-07 17:52:36,699 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-07 17:52:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:36,700 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-07 17:52:36,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:52:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-07 17:52:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:52:36,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:36,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:36,706 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:36,706 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-07 17:52:36,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:36,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301458082] [2019-12-07 17:52:36,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:36,778 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 17:52:36,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301458082] [2019-12-07 17:52:36,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:36,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:52:36,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134939714] [2019-12-07 17:52:36,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:52:36,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:36,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:52:36,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:52:36,780 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-07 17:52:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:38,922 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-07 17:52:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:52:38,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:52:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:39,229 INFO L225 Difference]: With dead ends: 123388 [2019-12-07 17:52:39,230 INFO L226 Difference]: Without dead ends: 123290 [2019-12-07 17:52:39,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 17:52:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-07 17:52:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-07 17:52:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-07 17:52:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-07 17:52:44,257 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-07 17:52:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:44,257 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-07 17:52:44,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:52:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-07 17:52:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:52:44,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:44,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:44,260 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-07 17:52:44,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:44,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180031612] [2019-12-07 17:52:44,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:44,317 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 17:52:44,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180031612] [2019-12-07 17:52:44,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:44,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:52:44,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664670464] [2019-12-07 17:52:44,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:52:44,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:44,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:52:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:52:44,318 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-07 17:52:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:44,448 INFO L93 Difference]: Finished difference Result 36525 states and 128382 transitions. [2019-12-07 17:52:44,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:52:44,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:52:44,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:44,497 INFO L225 Difference]: With dead ends: 36525 [2019-12-07 17:52:44,498 INFO L226 Difference]: Without dead ends: 28771 [2019-12-07 17:52:44,498 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 17:52:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28771 states. [2019-12-07 17:52:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28771 to 28723. [2019-12-07 17:52:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2019-12-07 17:52:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 97157 transitions. [2019-12-07 17:52:44,998 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 97157 transitions. Word has length 13 [2019-12-07 17:52:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:44,998 INFO L462 AbstractCegarLoop]: Abstraction has 28723 states and 97157 transitions. [2019-12-07 17:52:44,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:52:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 97157 transitions. [2019-12-07 17:52:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:52:44,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:45,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:45,000 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-07 17:52:45,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:45,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466552843] [2019-12-07 17:52:45,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:45,024 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 17:52:45,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466552843] [2019-12-07 17:52:45,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:45,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:52:45,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404747579] [2019-12-07 17:52:45,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:52:45,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:45,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:52:45,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:52:45,025 INFO L87 Difference]: Start difference. First operand 28723 states and 97157 transitions. Second operand 3 states. [2019-12-07 17:52:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:45,432 INFO L93 Difference]: Finished difference Result 42081 states and 141205 transitions. [2019-12-07 17:52:45,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:52:45,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:52:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:45,499 INFO L225 Difference]: With dead ends: 42081 [2019-12-07 17:52:45,499 INFO L226 Difference]: Without dead ends: 42081 [2019-12-07 17:52:45,500 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 17:52:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42081 states. [2019-12-07 17:52:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42081 to 32226. [2019-12-07 17:52:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32226 states. [2019-12-07 17:52:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32226 states to 32226 states and 107932 transitions. [2019-12-07 17:52:46,104 INFO L78 Accepts]: Start accepts. Automaton has 32226 states and 107932 transitions. Word has length 14 [2019-12-07 17:52:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:46,104 INFO L462 AbstractCegarLoop]: Abstraction has 32226 states and 107932 transitions. [2019-12-07 17:52:46,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:52:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 32226 states and 107932 transitions. [2019-12-07 17:52:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:52:46,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:46,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:46,106 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:46,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-07 17:52:46,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:46,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771886917] [2019-12-07 17:52:46,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:52:46,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771886917] [2019-12-07 17:52:46,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:46,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:52:46,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548333497] [2019-12-07 17:52:46,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:52:46,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:46,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:52:46,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:52:46,148 INFO L87 Difference]: Start difference. First operand 32226 states and 107932 transitions. Second operand 4 states. [2019-12-07 17:52:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:46,384 INFO L93 Difference]: Finished difference Result 39611 states and 130690 transitions. [2019-12-07 17:52:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:52:46,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:52:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:46,440 INFO L225 Difference]: With dead ends: 39611 [2019-12-07 17:52:46,440 INFO L226 Difference]: Without dead ends: 39522 [2019-12-07 17:52:46,440 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 17:52:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39522 states. [2019-12-07 17:52:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39522 to 34698. [2019-12-07 17:52:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34698 states. [2019-12-07 17:52:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34698 states to 34698 states and 115782 transitions. [2019-12-07 17:52:47,021 INFO L78 Accepts]: Start accepts. Automaton has 34698 states and 115782 transitions. Word has length 14 [2019-12-07 17:52:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:47,022 INFO L462 AbstractCegarLoop]: Abstraction has 34698 states and 115782 transitions. [2019-12-07 17:52:47,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:52:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 34698 states and 115782 transitions. [2019-12-07 17:52:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:52:47,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:47,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:47,023 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:47,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-07 17:52:47,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:47,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792533418] [2019-12-07 17:52:47,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:47,068 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 17:52:47,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792533418] [2019-12-07 17:52:47,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:47,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:52:47,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877529160] [2019-12-07 17:52:47,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:52:47,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:52:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:52:47,069 INFO L87 Difference]: Start difference. First operand 34698 states and 115782 transitions. Second operand 4 states. [2019-12-07 17:52:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:47,306 INFO L93 Difference]: Finished difference Result 42436 states and 139747 transitions. [2019-12-07 17:52:47,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:52:47,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:52:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:47,365 INFO L225 Difference]: With dead ends: 42436 [2019-12-07 17:52:47,365 INFO L226 Difference]: Without dead ends: 42329 [2019-12-07 17:52:47,366 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 17:52:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42329 states. [2019-12-07 17:52:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42329 to 36027. [2019-12-07 17:52:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36027 states. [2019-12-07 17:52:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36027 states to 36027 states and 119643 transitions. [2019-12-07 17:52:48,125 INFO L78 Accepts]: Start accepts. Automaton has 36027 states and 119643 transitions. Word has length 14 [2019-12-07 17:52:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:48,126 INFO L462 AbstractCegarLoop]: Abstraction has 36027 states and 119643 transitions. [2019-12-07 17:52:48,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:52:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 36027 states and 119643 transitions. [2019-12-07 17:52:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:52:48,134 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:48,134 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 17:52:48,134 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-07 17:52:48,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:48,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267898906] [2019-12-07 17:52:48,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:48,192 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 17:52:48,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267898906] [2019-12-07 17:52:48,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:48,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:52:48,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730405125] [2019-12-07 17:52:48,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:48,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:48,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:48,193 INFO L87 Difference]: Start difference. First operand 36027 states and 119643 transitions. Second operand 5 states. [2019-12-07 17:52:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:48,573 INFO L93 Difference]: Finished difference Result 48205 states and 157671 transitions. [2019-12-07 17:52:48,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:52:48,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 17:52:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:48,639 INFO L225 Difference]: With dead ends: 48205 [2019-12-07 17:52:48,639 INFO L226 Difference]: Without dead ends: 48029 [2019-12-07 17:52:48,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:52:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48029 states. [2019-12-07 17:52:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48029 to 36780. [2019-12-07 17:52:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36780 states. [2019-12-07 17:52:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36780 states to 36780 states and 122127 transitions. [2019-12-07 17:52:49,297 INFO L78 Accepts]: Start accepts. Automaton has 36780 states and 122127 transitions. Word has length 22 [2019-12-07 17:52:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:49,297 INFO L462 AbstractCegarLoop]: Abstraction has 36780 states and 122127 transitions. [2019-12-07 17:52:49,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 36780 states and 122127 transitions. [2019-12-07 17:52:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:52:49,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:49,303 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 17:52:49,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-07 17:52:49,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:49,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447262141] [2019-12-07 17:52:49,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:49,367 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 17:52:49,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447262141] [2019-12-07 17:52:49,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:49,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:52:49,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261889147] [2019-12-07 17:52:49,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:49,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:49,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:49,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:49,368 INFO L87 Difference]: Start difference. First operand 36780 states and 122127 transitions. Second operand 5 states. [2019-12-07 17:52:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:49,773 INFO L93 Difference]: Finished difference Result 49034 states and 160234 transitions. [2019-12-07 17:52:49,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:52:49,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 17:52:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:49,841 INFO L225 Difference]: With dead ends: 49034 [2019-12-07 17:52:49,841 INFO L226 Difference]: Without dead ends: 48752 [2019-12-07 17:52:49,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:52:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48752 states. [2019-12-07 17:52:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48752 to 34955. [2019-12-07 17:52:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34955 states. [2019-12-07 17:52:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34955 states to 34955 states and 116069 transitions. [2019-12-07 17:52:50,524 INFO L78 Accepts]: Start accepts. Automaton has 34955 states and 116069 transitions. Word has length 22 [2019-12-07 17:52:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:50,524 INFO L462 AbstractCegarLoop]: Abstraction has 34955 states and 116069 transitions. [2019-12-07 17:52:50,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 34955 states and 116069 transitions. [2019-12-07 17:52:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:52:50,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:50,534 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] [2019-12-07 17:52:50,534 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:50,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-07 17:52:50,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:50,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145156632] [2019-12-07 17:52:50,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:50,653 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 17:52:50,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145156632] [2019-12-07 17:52:50,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:50,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:52:50,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651355471] [2019-12-07 17:52:50,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:52:50,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:52:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:52:50,654 INFO L87 Difference]: Start difference. First operand 34955 states and 116069 transitions. Second operand 7 states. [2019-12-07 17:52:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:51,036 INFO L93 Difference]: Finished difference Result 48013 states and 156239 transitions. [2019-12-07 17:52:51,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:52:51,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-07 17:52:51,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:51,102 INFO L225 Difference]: With dead ends: 48013 [2019-12-07 17:52:51,102 INFO L226 Difference]: Without dead ends: 47985 [2019-12-07 17:52:51,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:52:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47985 states. [2019-12-07 17:52:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47985 to 39324. [2019-12-07 17:52:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39324 states. [2019-12-07 17:52:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39324 states to 39324 states and 129687 transitions. [2019-12-07 17:52:51,777 INFO L78 Accepts]: Start accepts. Automaton has 39324 states and 129687 transitions. Word has length 25 [2019-12-07 17:52:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:51,777 INFO L462 AbstractCegarLoop]: Abstraction has 39324 states and 129687 transitions. [2019-12-07 17:52:51,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:52:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 39324 states and 129687 transitions. [2019-12-07 17:52:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:52:51,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:51,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:51,791 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:51,791 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-07 17:52:51,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:51,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364577451] [2019-12-07 17:52:51,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:51,843 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 17:52:51,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364577451] [2019-12-07 17:52:51,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:51,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:52:51,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896279791] [2019-12-07 17:52:51,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:51,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:51,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:51,844 INFO L87 Difference]: Start difference. First operand 39324 states and 129687 transitions. Second operand 5 states. [2019-12-07 17:52:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:51,936 INFO L93 Difference]: Finished difference Result 17735 states and 54519 transitions. [2019-12-07 17:52:51,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:52:51,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 17:52:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:51,956 INFO L225 Difference]: With dead ends: 17735 [2019-12-07 17:52:51,956 INFO L226 Difference]: Without dead ends: 15148 [2019-12-07 17:52:51,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:52:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15148 states. [2019-12-07 17:52:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15148 to 14734. [2019-12-07 17:52:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14734 states. [2019-12-07 17:52:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14734 states to 14734 states and 44987 transitions. [2019-12-07 17:52:52,164 INFO L78 Accepts]: Start accepts. Automaton has 14734 states and 44987 transitions. Word has length 28 [2019-12-07 17:52:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:52,165 INFO L462 AbstractCegarLoop]: Abstraction has 14734 states and 44987 transitions. [2019-12-07 17:52:52,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 14734 states and 44987 transitions. [2019-12-07 17:52:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:52:52,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:52,183 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 17:52:52,183 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:52,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash -672186652, now seen corresponding path program 1 times [2019-12-07 17:52:52,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:52,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533699991] [2019-12-07 17:52:52,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:52,227 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 17:52:52,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533699991] [2019-12-07 17:52:52,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:52,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:52:52,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520049931] [2019-12-07 17:52:52,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:52:52,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:52,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:52:52,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:52:52,228 INFO L87 Difference]: Start difference. First operand 14734 states and 44987 transitions. Second operand 3 states. [2019-12-07 17:52:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:52,269 INFO L93 Difference]: Finished difference Result 14106 states and 42537 transitions. [2019-12-07 17:52:52,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:52:52,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 17:52:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:52,284 INFO L225 Difference]: With dead ends: 14106 [2019-12-07 17:52:52,284 INFO L226 Difference]: Without dead ends: 14106 [2019-12-07 17:52:52,284 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 17:52:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14106 states. [2019-12-07 17:52:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14106 to 14090. [2019-12-07 17:52:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14090 states. [2019-12-07 17:52:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14090 states to 14090 states and 42497 transitions. [2019-12-07 17:52:52,461 INFO L78 Accepts]: Start accepts. Automaton has 14090 states and 42497 transitions. Word has length 39 [2019-12-07 17:52:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:52,461 INFO L462 AbstractCegarLoop]: Abstraction has 14090 states and 42497 transitions. [2019-12-07 17:52:52,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:52:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 14090 states and 42497 transitions. [2019-12-07 17:52:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:52:52,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:52,481 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 17:52:52,482 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-07 17:52:52,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:52,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723878514] [2019-12-07 17:52:52,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:52,537 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 17:52:52,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723878514] [2019-12-07 17:52:52,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:52,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:52:52,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473815928] [2019-12-07 17:52:52,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:52:52,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:52,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:52:52,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:52:52,539 INFO L87 Difference]: Start difference. First operand 14090 states and 42497 transitions. Second operand 6 states. [2019-12-07 17:52:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:52,631 INFO L93 Difference]: Finished difference Result 12765 states and 39150 transitions. [2019-12-07 17:52:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:52:52,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 17:52:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:52,647 INFO L225 Difference]: With dead ends: 12765 [2019-12-07 17:52:52,647 INFO L226 Difference]: Without dead ends: 12582 [2019-12-07 17:52:52,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:52:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12582 states. [2019-12-07 17:52:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12582 to 11090. [2019-12-07 17:52:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11090 states. [2019-12-07 17:52:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11090 states to 11090 states and 34386 transitions. [2019-12-07 17:52:52,856 INFO L78 Accepts]: Start accepts. Automaton has 11090 states and 34386 transitions. Word has length 40 [2019-12-07 17:52:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:52,856 INFO L462 AbstractCegarLoop]: Abstraction has 11090 states and 34386 transitions. [2019-12-07 17:52:52,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:52:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 11090 states and 34386 transitions. [2019-12-07 17:52:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:52:52,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:52,869 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] [2019-12-07 17:52:52,870 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1309277586, now seen corresponding path program 1 times [2019-12-07 17:52:52,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:52,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554685460] [2019-12-07 17:52:52,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:52,922 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 17:52:52,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554685460] [2019-12-07 17:52:52,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:52,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:52:52,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331662942] [2019-12-07 17:52:52,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:52,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:52,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:52,923 INFO L87 Difference]: Start difference. First operand 11090 states and 34386 transitions. Second operand 5 states. [2019-12-07 17:52:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:53,207 INFO L93 Difference]: Finished difference Result 16960 states and 51929 transitions. [2019-12-07 17:52:53,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:52:53,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 17:52:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:53,226 INFO L225 Difference]: With dead ends: 16960 [2019-12-07 17:52:53,226 INFO L226 Difference]: Without dead ends: 16960 [2019-12-07 17:52:53,227 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 17:52:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16960 states. [2019-12-07 17:52:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16960 to 14500. [2019-12-07 17:52:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14500 states. [2019-12-07 17:52:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14500 states to 14500 states and 44927 transitions. [2019-12-07 17:52:53,433 INFO L78 Accepts]: Start accepts. Automaton has 14500 states and 44927 transitions. Word has length 55 [2019-12-07 17:52:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:53,433 INFO L462 AbstractCegarLoop]: Abstraction has 14500 states and 44927 transitions. [2019-12-07 17:52:53,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14500 states and 44927 transitions. [2019-12-07 17:52:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:52:53,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:53,445 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] [2019-12-07 17:52:53,446 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash 843462384, now seen corresponding path program 2 times [2019-12-07 17:52:53,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:53,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816343928] [2019-12-07 17:52:53,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:53,505 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 17:52:53,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816343928] [2019-12-07 17:52:53,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:53,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:52:53,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761768578] [2019-12-07 17:52:53,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:52:53,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:52:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:52:53,507 INFO L87 Difference]: Start difference. First operand 14500 states and 44927 transitions. Second operand 3 states. [2019-12-07 17:52:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:53,552 INFO L93 Difference]: Finished difference Result 14498 states and 44922 transitions. [2019-12-07 17:52:53,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:52:53,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 17:52:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:53,568 INFO L225 Difference]: With dead ends: 14498 [2019-12-07 17:52:53,569 INFO L226 Difference]: Without dead ends: 14498 [2019-12-07 17:52:53,569 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 17:52:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-07 17:52:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 12267. [2019-12-07 17:52:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12267 states. [2019-12-07 17:52:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12267 states to 12267 states and 38540 transitions. [2019-12-07 17:52:53,742 INFO L78 Accepts]: Start accepts. Automaton has 12267 states and 38540 transitions. Word has length 55 [2019-12-07 17:52:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:53,742 INFO L462 AbstractCegarLoop]: Abstraction has 12267 states and 38540 transitions. [2019-12-07 17:52:53,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:52:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12267 states and 38540 transitions. [2019-12-07 17:52:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:52:53,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:53,753 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] [2019-12-07 17:52:53,753 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash -252026634, now seen corresponding path program 1 times [2019-12-07 17:52:53,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:53,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574806100] [2019-12-07 17:52:53,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:53,819 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 17:52:53,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574806100] [2019-12-07 17:52:53,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:53,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:52:53,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864554488] [2019-12-07 17:52:53,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:53,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:53,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:53,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:53,821 INFO L87 Difference]: Start difference. First operand 12267 states and 38540 transitions. Second operand 5 states. [2019-12-07 17:52:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:53,933 INFO L93 Difference]: Finished difference Result 38871 states and 122390 transitions. [2019-12-07 17:52:53,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:52:53,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-07 17:52:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:53,955 INFO L225 Difference]: With dead ends: 38871 [2019-12-07 17:52:53,956 INFO L226 Difference]: Without dead ends: 20116 [2019-12-07 17:52:53,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:52:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20116 states. [2019-12-07 17:52:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20116 to 11927. [2019-12-07 17:52:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11927 states. [2019-12-07 17:52:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 37277 transitions. [2019-12-07 17:52:54,164 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 37277 transitions. Word has length 56 [2019-12-07 17:52:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:54,164 INFO L462 AbstractCegarLoop]: Abstraction has 11927 states and 37277 transitions. [2019-12-07 17:52:54,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 37277 transitions. [2019-12-07 17:52:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:52:54,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:54,175 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] [2019-12-07 17:52:54,175 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:54,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1782045904, now seen corresponding path program 2 times [2019-12-07 17:52:54,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:54,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595688020] [2019-12-07 17:52:54,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:54,212 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 17:52:54,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595688020] [2019-12-07 17:52:54,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:54,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:52:54,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950036835] [2019-12-07 17:52:54,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:52:54,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:54,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:52:54,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:52:54,213 INFO L87 Difference]: Start difference. First operand 11927 states and 37277 transitions. Second operand 3 states. [2019-12-07 17:52:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:54,281 INFO L93 Difference]: Finished difference Result 20116 states and 63047 transitions. [2019-12-07 17:52:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:52:54,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 17:52:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:54,291 INFO L225 Difference]: With dead ends: 20116 [2019-12-07 17:52:54,291 INFO L226 Difference]: Without dead ends: 8637 [2019-12-07 17:52:54,292 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 17:52:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8637 states. [2019-12-07 17:52:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8637 to 8637. [2019-12-07 17:52:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8637 states. [2019-12-07 17:52:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8637 states to 8637 states and 26947 transitions. [2019-12-07 17:52:54,411 INFO L78 Accepts]: Start accepts. Automaton has 8637 states and 26947 transitions. Word has length 56 [2019-12-07 17:52:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:54,411 INFO L462 AbstractCegarLoop]: Abstraction has 8637 states and 26947 transitions. [2019-12-07 17:52:54,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:52:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 8637 states and 26947 transitions. [2019-12-07 17:52:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:52:54,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:54,419 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] [2019-12-07 17:52:54,419 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:54,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:54,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1822789126, now seen corresponding path program 3 times [2019-12-07 17:52:54,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:54,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422492410] [2019-12-07 17:52:54,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:54,458 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 17:52:54,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422492410] [2019-12-07 17:52:54,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:54,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:52:54,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009229636] [2019-12-07 17:52:54,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:52:54,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:54,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:52:54,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:52:54,460 INFO L87 Difference]: Start difference. First operand 8637 states and 26947 transitions. Second operand 4 states. [2019-12-07 17:52:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:54,506 INFO L93 Difference]: Finished difference Result 15229 states and 47820 transitions. [2019-12-07 17:52:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:52:54,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 17:52:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:54,514 INFO L225 Difference]: With dead ends: 15229 [2019-12-07 17:52:54,514 INFO L226 Difference]: Without dead ends: 6664 [2019-12-07 17:52:54,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 17:52:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2019-12-07 17:52:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6664. [2019-12-07 17:52:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6664 states. [2019-12-07 17:52:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6664 states to 6664 states and 21007 transitions. [2019-12-07 17:52:54,611 INFO L78 Accepts]: Start accepts. Automaton has 6664 states and 21007 transitions. Word has length 56 [2019-12-07 17:52:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:54,611 INFO L462 AbstractCegarLoop]: Abstraction has 6664 states and 21007 transitions. [2019-12-07 17:52:54,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:52:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 6664 states and 21007 transitions. [2019-12-07 17:52:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:52:54,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:54,617 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] [2019-12-07 17:52:54,617 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash 259489780, now seen corresponding path program 4 times [2019-12-07 17:52:54,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:54,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068071423] [2019-12-07 17:52:54,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:54,937 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 17:52:54,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068071423] [2019-12-07 17:52:54,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:54,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:52:54,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891359769] [2019-12-07 17:52:54,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:52:54,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:54,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:52:54,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:52:54,938 INFO L87 Difference]: Start difference. First operand 6664 states and 21007 transitions. Second operand 15 states. [2019-12-07 17:52:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:57,002 INFO L93 Difference]: Finished difference Result 14740 states and 45219 transitions. [2019-12-07 17:52:57,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-07 17:52:57,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 17:52:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:57,013 INFO L225 Difference]: With dead ends: 14740 [2019-12-07 17:52:57,013 INFO L226 Difference]: Without dead ends: 9226 [2019-12-07 17:52:57,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=449, Invalid=2307, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 17:52:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9226 states. [2019-12-07 17:52:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9226 to 7633. [2019-12-07 17:52:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-12-07 17:52:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 23902 transitions. [2019-12-07 17:52:57,151 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 23902 transitions. Word has length 56 [2019-12-07 17:52:57,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:57,151 INFO L462 AbstractCegarLoop]: Abstraction has 7633 states and 23902 transitions. [2019-12-07 17:52:57,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:52:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 23902 transitions. [2019-12-07 17:52:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:52:57,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:57,157 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] [2019-12-07 17:52:57,157 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash -791222136, now seen corresponding path program 5 times [2019-12-07 17:52:57,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:57,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823543951] [2019-12-07 17:52:57,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:57,343 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 17:52:57,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823543951] [2019-12-07 17:52:57,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:57,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:52:57,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950967688] [2019-12-07 17:52:57,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:52:57,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:57,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:52:57,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:52:57,344 INFO L87 Difference]: Start difference. First operand 7633 states and 23902 transitions. Second operand 11 states. [2019-12-07 17:52:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:58,367 INFO L93 Difference]: Finished difference Result 18024 states and 55475 transitions. [2019-12-07 17:52:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 17:52:58,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 17:52:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:58,378 INFO L225 Difference]: With dead ends: 18024 [2019-12-07 17:52:58,378 INFO L226 Difference]: Without dead ends: 10455 [2019-12-07 17:52:58,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=2291, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 17:52:58,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10455 states. [2019-12-07 17:52:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10455 to 8279. [2019-12-07 17:52:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8279 states. [2019-12-07 17:52:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8279 states to 8279 states and 25344 transitions. [2019-12-07 17:52:58,497 INFO L78 Accepts]: Start accepts. Automaton has 8279 states and 25344 transitions. Word has length 56 [2019-12-07 17:52:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:58,498 INFO L462 AbstractCegarLoop]: Abstraction has 8279 states and 25344 transitions. [2019-12-07 17:52:58,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:52:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8279 states and 25344 transitions. [2019-12-07 17:52:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:52:58,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:58,504 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] [2019-12-07 17:52:58,504 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash -739722002, now seen corresponding path program 6 times [2019-12-07 17:52:58,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:58,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956272572] [2019-12-07 17:52:58,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:58,736 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 17:52:58,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956272572] [2019-12-07 17:52:58,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:58,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:52:58,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083968097] [2019-12-07 17:52:58,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:52:58,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:52:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:52:58,738 INFO L87 Difference]: Start difference. First operand 8279 states and 25344 transitions. Second operand 11 states. [2019-12-07 17:52:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:59,145 INFO L93 Difference]: Finished difference Result 11223 states and 34264 transitions. [2019-12-07 17:52:59,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:52:59,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 17:52:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:59,156 INFO L225 Difference]: With dead ends: 11223 [2019-12-07 17:52:59,156 INFO L226 Difference]: Without dead ends: 10913 [2019-12-07 17:52:59,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:52:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-12-07 17:52:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 10241. [2019-12-07 17:52:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10241 states. [2019-12-07 17:52:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10241 states to 10241 states and 31371 transitions. [2019-12-07 17:52:59,292 INFO L78 Accepts]: Start accepts. Automaton has 10241 states and 31371 transitions. Word has length 56 [2019-12-07 17:52:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:59,293 INFO L462 AbstractCegarLoop]: Abstraction has 10241 states and 31371 transitions. [2019-12-07 17:52:59,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:52:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 10241 states and 31371 transitions. [2019-12-07 17:52:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:52:59,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:59,301 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] [2019-12-07 17:52:59,301 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:59,301 INFO L82 PathProgramCache]: Analyzing trace with hash 957540810, now seen corresponding path program 7 times [2019-12-07 17:52:59,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:59,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789320303] [2019-12-07 17:52:59,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:59,492 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 17:52:59,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789320303] [2019-12-07 17:52:59,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:59,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:52:59,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328059384] [2019-12-07 17:52:59,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:52:59,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:59,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:52:59,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:52:59,493 INFO L87 Difference]: Start difference. First operand 10241 states and 31371 transitions. Second operand 11 states. [2019-12-07 17:53:00,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:00,135 INFO L93 Difference]: Finished difference Result 13192 states and 39701 transitions. [2019-12-07 17:53:00,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:53:00,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 17:53:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:00,146 INFO L225 Difference]: With dead ends: 13192 [2019-12-07 17:53:00,146 INFO L226 Difference]: Without dead ends: 10942 [2019-12-07 17:53:00,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:53:00,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10942 states. [2019-12-07 17:53:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10942 to 9728. [2019-12-07 17:53:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9728 states. [2019-12-07 17:53:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9728 states to 9728 states and 29690 transitions. [2019-12-07 17:53:00,281 INFO L78 Accepts]: Start accepts. Automaton has 9728 states and 29690 transitions. Word has length 56 [2019-12-07 17:53:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:00,281 INFO L462 AbstractCegarLoop]: Abstraction has 9728 states and 29690 transitions. [2019-12-07 17:53:00,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:53:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 9728 states and 29690 transitions. [2019-12-07 17:53:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:53:00,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:00,289 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] [2019-12-07 17:53:00,289 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:53:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2122420018, now seen corresponding path program 8 times [2019-12-07 17:53:00,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:00,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032473822] [2019-12-07 17:53:00,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:00,641 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 17:53:00,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032473822] [2019-12-07 17:53:00,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:00,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:53:00,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062989547] [2019-12-07 17:53:00,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:53:00,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:00,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:53:00,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:53:00,642 INFO L87 Difference]: Start difference. First operand 9728 states and 29690 transitions. Second operand 14 states. [2019-12-07 17:53:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:01,680 INFO L93 Difference]: Finished difference Result 12477 states and 37373 transitions. [2019-12-07 17:53:01,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 17:53:01,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-07 17:53:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:01,691 INFO L225 Difference]: With dead ends: 12477 [2019-12-07 17:53:01,691 INFO L226 Difference]: Without dead ends: 11135 [2019-12-07 17:53:01,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2019-12-07 17:53:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-12-07 17:53:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9656. [2019-12-07 17:53:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9656 states. [2019-12-07 17:53:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9656 states to 9656 states and 29346 transitions. [2019-12-07 17:53:01,826 INFO L78 Accepts]: Start accepts. Automaton has 9656 states and 29346 transitions. Word has length 56 [2019-12-07 17:53:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:01,826 INFO L462 AbstractCegarLoop]: Abstraction has 9656 states and 29346 transitions. [2019-12-07 17:53:01,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:53:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 9656 states and 29346 transitions. [2019-12-07 17:53:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:53:01,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:01,834 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] [2019-12-07 17:53:01,834 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:53:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:01,834 INFO L82 PathProgramCache]: Analyzing trace with hash 302323240, now seen corresponding path program 9 times [2019-12-07 17:53:01,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:01,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039954117] [2019-12-07 17:53:01,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:02,009 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 17:53:02,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039954117] [2019-12-07 17:53:02,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:02,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:53:02,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092868003] [2019-12-07 17:53:02,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:53:02,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:53:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:53:02,010 INFO L87 Difference]: Start difference. First operand 9656 states and 29346 transitions. Second operand 11 states. [2019-12-07 17:53:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:02,698 INFO L93 Difference]: Finished difference Result 11203 states and 33537 transitions. [2019-12-07 17:53:02,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 17:53:02,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 17:53:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:02,707 INFO L225 Difference]: With dead ends: 11203 [2019-12-07 17:53:02,707 INFO L226 Difference]: Without dead ends: 9067 [2019-12-07 17:53:02,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 17:53:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-07 17:53:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 7717. [2019-12-07 17:53:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7717 states. [2019-12-07 17:53:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7717 states to 7717 states and 23658 transitions. [2019-12-07 17:53:02,815 INFO L78 Accepts]: Start accepts. Automaton has 7717 states and 23658 transitions. Word has length 56 [2019-12-07 17:53:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:02,816 INFO L462 AbstractCegarLoop]: Abstraction has 7717 states and 23658 transitions. [2019-12-07 17:53:02,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:53:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7717 states and 23658 transitions. [2019-12-07 17:53:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:53:02,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:02,822 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] [2019-12-07 17:53:02,822 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:53:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 10 times [2019-12-07 17:53:02,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:02,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439693047] [2019-12-07 17:53:02,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:53:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:53:02,893 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:53:02,893 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:53:02,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1912~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1912~0.base_26|) |v_ULTIMATE.start_main_~#t1912~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1912~0.base_26| 1)) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1912~0.base_26|) 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1912~0.base_26| 4)) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1912~0.base_26|) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= 0 |v_ULTIMATE.start_main_~#t1912~0.offset_20|) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t1914~0.offset=|v_ULTIMATE.start_main_~#t1914~0.offset_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ULTIMATE.start_main_~#t1912~0.base=|v_ULTIMATE.start_main_~#t1912~0.base_26|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_~#t1913~0.base=|v_ULTIMATE.start_main_~#t1913~0.base_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, ULTIMATE.start_main_~#t1912~0.offset=|v_ULTIMATE.start_main_~#t1912~0.offset_20|, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1913~0.offset=|v_ULTIMATE.start_main_~#t1913~0.offset_20|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ULTIMATE.start_main_~#t1914~0.base=|v_ULTIMATE.start_main_~#t1914~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1913~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1914~0.offset, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_~#t1912~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1912~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t1913~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1914~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:53:02,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1913~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1913~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1913~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1913~0.offset_9| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1913~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1913~0.base_10|) |v_ULTIMATE.start_main_~#t1913~0.offset_9| 1)) |v_#memory_int_15|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1913~0.base_10| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1913~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1913~0.base=|v_ULTIMATE.start_main_~#t1913~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1913~0.offset=|v_ULTIMATE.start_main_~#t1913~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1913~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1913~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:53:02,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_45 256) 0)) (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= 1 v_~x$w_buff0~0_22)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 17:53:02,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1914~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1914~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1914~0.base_11|) |v_ULTIMATE.start_main_~#t1914~0.offset_10| 2)) |v_#memory_int_13|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1914~0.base_11| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t1914~0.offset_10| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1914~0.base_11| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1914~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1914~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1914~0.base=|v_ULTIMATE.start_main_~#t1914~0.base_11|, ULTIMATE.start_main_~#t1914~0.offset=|v_ULTIMATE.start_main_~#t1914~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1914~0.base, ULTIMATE.start_main_~#t1914~0.offset] because there is no mapped edge [2019-12-07 17:53:02,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In878664017 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In878664017 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In878664017 |P2Thread1of1ForFork1_#t~ite32_Out878664017|)) (and (= ~x~0_In878664017 |P2Thread1of1ForFork1_#t~ite32_Out878664017|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In878664017, ~x$w_buff1_used~0=~x$w_buff1_used~0_In878664017, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In878664017, ~x~0=~x~0_In878664017} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out878664017|, ~x$w_buff1~0=~x$w_buff1~0_In878664017, ~x$w_buff1_used~0=~x$w_buff1_used~0_In878664017, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In878664017, ~x~0=~x~0_In878664017} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:53:02,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_6|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_6|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_5|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 17:53:02,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1822149697 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1822149697 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1822149697|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1822149697 |P2Thread1of1ForFork1_#t~ite34_Out-1822149697|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1822149697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1822149697} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1822149697|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1822149697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1822149697} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:53:02,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1240307973 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1240307973 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1240307973 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1240307973 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In1240307973 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite9_Out1240307973| |P0Thread1of1ForFork2_#t~ite8_Out1240307973|) (= ~x$w_buff0~0_In1240307973 |P0Thread1of1ForFork2_#t~ite8_Out1240307973|)) (and (= ~x$w_buff0~0_In1240307973 |P0Thread1of1ForFork2_#t~ite9_Out1240307973|) (= |P0Thread1of1ForFork2_#t~ite8_In1240307973| |P0Thread1of1ForFork2_#t~ite8_Out1240307973|) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1240307973, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1240307973, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In1240307973|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1240307973, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1240307973, ~weak$$choice2~0=~weak$$choice2~0_In1240307973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240307973} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1240307973, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1240307973, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1240307973|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1240307973, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1240307973|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1240307973, ~weak$$choice2~0=~weak$$choice2~0_In1240307973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240307973} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 17:53:02,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In856994516 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In856994516 256) 0))) (or (and (= ~x$w_buff0_used~0_In856994516 |P1Thread1of1ForFork0_#t~ite28_Out856994516|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out856994516|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In856994516, ~x$w_buff0_used~0=~x$w_buff0_used~0_In856994516} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In856994516, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out856994516|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In856994516} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:53:02,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In597987553 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In597987553 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In597987553 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In597987553 256)))) (or (and (= ~x$w_buff1_used~0_In597987553 |P1Thread1of1ForFork0_#t~ite29_Out597987553|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out597987553|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In597987553, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In597987553, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In597987553, ~x$w_buff0_used~0=~x$w_buff0_used~0_In597987553} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In597987553, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In597987553, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In597987553, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out597987553|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In597987553} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:53:02,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_Out459088056 ~x$r_buff0_thd2~0_In459088056)) (.cse0 (= (mod ~x$w_buff0_used~0_In459088056 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In459088056 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (not .cse2) (= ~x$r_buff0_thd2~0_Out459088056 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In459088056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In459088056} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out459088056|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out459088056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In459088056} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:53:02,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-96007048 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-96007048 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-96007048 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-96007048 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-96007048| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out-96007048| ~x$r_buff1_thd2~0_In-96007048)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-96007048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-96007048, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-96007048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-96007048} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-96007048|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-96007048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-96007048, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-96007048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-96007048} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:53:02,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:53:02,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-323192918 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-323192918 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-323192918 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-323192918 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-323192918| ~x$w_buff1_used~0_In-323192918)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite35_Out-323192918| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-323192918, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-323192918, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-323192918, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-323192918} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-323192918|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-323192918, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-323192918, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-323192918, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-323192918} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:53:02,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1049800232 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1049800232 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1049800232| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1049800232| ~x$r_buff0_thd3~0_In-1049800232) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1049800232, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1049800232} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1049800232|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1049800232, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1049800232} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:53:02,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-546169523 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-546169523| |P0Thread1of1ForFork2_#t~ite17_Out-546169523|) (= ~x$w_buff1_used~0_In-546169523 |P0Thread1of1ForFork2_#t~ite18_Out-546169523|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-546169523 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-546169523 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-546169523 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In-546169523 256)) .cse1))) .cse0 (= ~x$w_buff1_used~0_In-546169523 |P0Thread1of1ForFork2_#t~ite17_Out-546169523|) (= |P0Thread1of1ForFork2_#t~ite17_Out-546169523| |P0Thread1of1ForFork2_#t~ite18_Out-546169523|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-546169523, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-546169523|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-546169523, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-546169523, ~weak$$choice2~0=~weak$$choice2~0_In-546169523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-546169523} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-546169523, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-546169523|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-546169523|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-546169523, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-546169523, ~weak$$choice2~0=~weak$$choice2~0_In-546169523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-546169523} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 17:53:02,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 17:53:02,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-438695928 256)))) (or (and (= ~x$r_buff1_thd1~0_In-438695928 |P0Thread1of1ForFork2_#t~ite24_Out-438695928|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-438695928| |P0Thread1of1ForFork2_#t~ite23_Out-438695928|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-438695928 256)))) (or (= (mod ~x$w_buff0_used~0_In-438695928 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-438695928 256))) (and (= (mod ~x$w_buff1_used~0_In-438695928 256) 0) .cse1))) .cse0 (= ~x$r_buff1_thd1~0_In-438695928 |P0Thread1of1ForFork2_#t~ite23_Out-438695928|) (= |P0Thread1of1ForFork2_#t~ite23_Out-438695928| |P0Thread1of1ForFork2_#t~ite24_Out-438695928|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-438695928, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-438695928, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-438695928, ~weak$$choice2~0=~weak$$choice2~0_In-438695928, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-438695928|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438695928} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-438695928, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-438695928, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-438695928, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-438695928|, ~weak$$choice2~0=~weak$$choice2~0_In-438695928, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-438695928|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438695928} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 17:53:02,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1902146358 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1902146358 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1902146358 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1902146358 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1902146358| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-1902146358| ~x$r_buff1_thd3~0_In-1902146358)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1902146358, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1902146358, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1902146358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1902146358} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1902146358|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1902146358, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1902146358, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1902146358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1902146358} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:53:02,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:53:02,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:53:02,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:53:02,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In376523088 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In376523088 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out376523088| ~x$w_buff1~0_In376523088) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In376523088 |ULTIMATE.start_main_#t~ite41_Out376523088|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In376523088, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376523088, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In376523088, ~x~0=~x~0_In376523088} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out376523088|, ~x$w_buff1~0=~x$w_buff1~0_In376523088, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376523088, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In376523088, ~x~0=~x~0_In376523088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 17:53:02,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 17:53:02,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-363933948 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-363933948 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-363933948| ~x$w_buff0_used~0_In-363933948) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-363933948| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-363933948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363933948} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-363933948, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-363933948|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363933948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:53:02,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1904049757 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1904049757 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1904049757 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1904049757 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1904049757|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1904049757 |ULTIMATE.start_main_#t~ite44_Out-1904049757|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1904049757, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1904049757, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1904049757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1904049757} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1904049757, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1904049757, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1904049757, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1904049757|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1904049757} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:53:02,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In285516274 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In285516274 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In285516274 |ULTIMATE.start_main_#t~ite45_Out285516274|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out285516274| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In285516274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In285516274} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In285516274, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out285516274|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In285516274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:53:02,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-439465768 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-439465768 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-439465768 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-439465768 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-439465768|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-439465768 |ULTIMATE.start_main_#t~ite46_Out-439465768|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-439465768, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-439465768, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-439465768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-439465768} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-439465768, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-439465768|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-439465768, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-439465768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-439465768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 17:53:02,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 (ite (= 0 (ite (not (and (= v_~y~0_272 2) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:53:02,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:53:02 BasicIcfg [2019-12-07 17:53:02,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:53:02,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:53:02,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:53:02,953 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:53:02,954 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:52:18" (3/4) ... [2019-12-07 17:53:02,955 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:53:02,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1912~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1912~0.base_26|) |v_ULTIMATE.start_main_~#t1912~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1912~0.base_26| 1)) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1912~0.base_26|) 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1912~0.base_26| 4)) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1912~0.base_26|) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= 0 |v_ULTIMATE.start_main_~#t1912~0.offset_20|) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t1914~0.offset=|v_ULTIMATE.start_main_~#t1914~0.offset_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ULTIMATE.start_main_~#t1912~0.base=|v_ULTIMATE.start_main_~#t1912~0.base_26|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_~#t1913~0.base=|v_ULTIMATE.start_main_~#t1913~0.base_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, ULTIMATE.start_main_~#t1912~0.offset=|v_ULTIMATE.start_main_~#t1912~0.offset_20|, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1913~0.offset=|v_ULTIMATE.start_main_~#t1913~0.offset_20|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ULTIMATE.start_main_~#t1914~0.base=|v_ULTIMATE.start_main_~#t1914~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1913~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1914~0.offset, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_~#t1912~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1912~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t1913~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1914~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:53:02,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1913~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1913~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1913~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1913~0.offset_9| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1913~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1913~0.base_10|) |v_ULTIMATE.start_main_~#t1913~0.offset_9| 1)) |v_#memory_int_15|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1913~0.base_10| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1913~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1913~0.base=|v_ULTIMATE.start_main_~#t1913~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1913~0.offset=|v_ULTIMATE.start_main_~#t1913~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1913~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1913~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:53:02,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_45 256) 0)) (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= 1 v_~x$w_buff0~0_22)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 17:53:02,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1914~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1914~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1914~0.base_11|) |v_ULTIMATE.start_main_~#t1914~0.offset_10| 2)) |v_#memory_int_13|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1914~0.base_11| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t1914~0.offset_10| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1914~0.base_11| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1914~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1914~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1914~0.base=|v_ULTIMATE.start_main_~#t1914~0.base_11|, ULTIMATE.start_main_~#t1914~0.offset=|v_ULTIMATE.start_main_~#t1914~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1914~0.base, ULTIMATE.start_main_~#t1914~0.offset] because there is no mapped edge [2019-12-07 17:53:02,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In878664017 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In878664017 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In878664017 |P2Thread1of1ForFork1_#t~ite32_Out878664017|)) (and (= ~x~0_In878664017 |P2Thread1of1ForFork1_#t~ite32_Out878664017|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In878664017, ~x$w_buff1_used~0=~x$w_buff1_used~0_In878664017, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In878664017, ~x~0=~x~0_In878664017} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out878664017|, ~x$w_buff1~0=~x$w_buff1~0_In878664017, ~x$w_buff1_used~0=~x$w_buff1_used~0_In878664017, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In878664017, ~x~0=~x~0_In878664017} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:53:02,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_6|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_6|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_5|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 17:53:02,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1822149697 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1822149697 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1822149697|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1822149697 |P2Thread1of1ForFork1_#t~ite34_Out-1822149697|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1822149697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1822149697} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1822149697|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1822149697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1822149697} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:53:02,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1240307973 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1240307973 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1240307973 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1240307973 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In1240307973 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite9_Out1240307973| |P0Thread1of1ForFork2_#t~ite8_Out1240307973|) (= ~x$w_buff0~0_In1240307973 |P0Thread1of1ForFork2_#t~ite8_Out1240307973|)) (and (= ~x$w_buff0~0_In1240307973 |P0Thread1of1ForFork2_#t~ite9_Out1240307973|) (= |P0Thread1of1ForFork2_#t~ite8_In1240307973| |P0Thread1of1ForFork2_#t~ite8_Out1240307973|) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1240307973, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1240307973, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In1240307973|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1240307973, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1240307973, ~weak$$choice2~0=~weak$$choice2~0_In1240307973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240307973} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1240307973, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1240307973, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1240307973|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1240307973, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1240307973|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1240307973, ~weak$$choice2~0=~weak$$choice2~0_In1240307973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240307973} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 17:53:02,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In856994516 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In856994516 256) 0))) (or (and (= ~x$w_buff0_used~0_In856994516 |P1Thread1of1ForFork0_#t~ite28_Out856994516|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out856994516|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In856994516, ~x$w_buff0_used~0=~x$w_buff0_used~0_In856994516} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In856994516, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out856994516|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In856994516} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:53:02,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In597987553 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In597987553 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In597987553 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In597987553 256)))) (or (and (= ~x$w_buff1_used~0_In597987553 |P1Thread1of1ForFork0_#t~ite29_Out597987553|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out597987553|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In597987553, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In597987553, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In597987553, ~x$w_buff0_used~0=~x$w_buff0_used~0_In597987553} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In597987553, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In597987553, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In597987553, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out597987553|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In597987553} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:53:02,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_Out459088056 ~x$r_buff0_thd2~0_In459088056)) (.cse0 (= (mod ~x$w_buff0_used~0_In459088056 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In459088056 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (not .cse2) (= ~x$r_buff0_thd2~0_Out459088056 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In459088056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In459088056} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out459088056|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out459088056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In459088056} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:53:02,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-96007048 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-96007048 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-96007048 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-96007048 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-96007048| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out-96007048| ~x$r_buff1_thd2~0_In-96007048)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-96007048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-96007048, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-96007048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-96007048} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-96007048|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-96007048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-96007048, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-96007048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-96007048} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:53:02,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:53:02,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-323192918 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-323192918 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-323192918 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-323192918 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-323192918| ~x$w_buff1_used~0_In-323192918)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite35_Out-323192918| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-323192918, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-323192918, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-323192918, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-323192918} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-323192918|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-323192918, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-323192918, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-323192918, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-323192918} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:53:02,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1049800232 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1049800232 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1049800232| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1049800232| ~x$r_buff0_thd3~0_In-1049800232) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1049800232, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1049800232} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1049800232|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1049800232, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1049800232} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:53:02,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-546169523 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-546169523| |P0Thread1of1ForFork2_#t~ite17_Out-546169523|) (= ~x$w_buff1_used~0_In-546169523 |P0Thread1of1ForFork2_#t~ite18_Out-546169523|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-546169523 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-546169523 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-546169523 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In-546169523 256)) .cse1))) .cse0 (= ~x$w_buff1_used~0_In-546169523 |P0Thread1of1ForFork2_#t~ite17_Out-546169523|) (= |P0Thread1of1ForFork2_#t~ite17_Out-546169523| |P0Thread1of1ForFork2_#t~ite18_Out-546169523|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-546169523, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-546169523|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-546169523, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-546169523, ~weak$$choice2~0=~weak$$choice2~0_In-546169523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-546169523} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-546169523, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-546169523|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-546169523|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-546169523, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-546169523, ~weak$$choice2~0=~weak$$choice2~0_In-546169523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-546169523} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 17:53:02,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 17:53:02,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-438695928 256)))) (or (and (= ~x$r_buff1_thd1~0_In-438695928 |P0Thread1of1ForFork2_#t~ite24_Out-438695928|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-438695928| |P0Thread1of1ForFork2_#t~ite23_Out-438695928|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-438695928 256)))) (or (= (mod ~x$w_buff0_used~0_In-438695928 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-438695928 256))) (and (= (mod ~x$w_buff1_used~0_In-438695928 256) 0) .cse1))) .cse0 (= ~x$r_buff1_thd1~0_In-438695928 |P0Thread1of1ForFork2_#t~ite23_Out-438695928|) (= |P0Thread1of1ForFork2_#t~ite23_Out-438695928| |P0Thread1of1ForFork2_#t~ite24_Out-438695928|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-438695928, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-438695928, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-438695928, ~weak$$choice2~0=~weak$$choice2~0_In-438695928, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-438695928|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438695928} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-438695928, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-438695928, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-438695928, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-438695928|, ~weak$$choice2~0=~weak$$choice2~0_In-438695928, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-438695928|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438695928} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 17:53:02,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1902146358 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1902146358 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1902146358 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1902146358 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1902146358| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-1902146358| ~x$r_buff1_thd3~0_In-1902146358)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1902146358, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1902146358, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1902146358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1902146358} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1902146358|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1902146358, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1902146358, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1902146358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1902146358} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:53:02,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:53:02,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:53:02,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:53:02,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In376523088 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In376523088 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out376523088| ~x$w_buff1~0_In376523088) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In376523088 |ULTIMATE.start_main_#t~ite41_Out376523088|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In376523088, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376523088, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In376523088, ~x~0=~x~0_In376523088} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out376523088|, ~x$w_buff1~0=~x$w_buff1~0_In376523088, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376523088, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In376523088, ~x~0=~x~0_In376523088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 17:53:02,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 17:53:02,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-363933948 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-363933948 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-363933948| ~x$w_buff0_used~0_In-363933948) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-363933948| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-363933948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363933948} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-363933948, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-363933948|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363933948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:53:02,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1904049757 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1904049757 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1904049757 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1904049757 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1904049757|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1904049757 |ULTIMATE.start_main_#t~ite44_Out-1904049757|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1904049757, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1904049757, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1904049757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1904049757} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1904049757, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1904049757, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1904049757, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1904049757|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1904049757} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:53:02,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In285516274 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In285516274 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In285516274 |ULTIMATE.start_main_#t~ite45_Out285516274|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out285516274| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In285516274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In285516274} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In285516274, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out285516274|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In285516274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:53:02,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-439465768 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-439465768 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-439465768 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-439465768 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-439465768|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-439465768 |ULTIMATE.start_main_#t~ite46_Out-439465768|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-439465768, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-439465768, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-439465768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-439465768} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-439465768, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-439465768|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-439465768, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-439465768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-439465768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 17:53:02,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 (ite (= 0 (ite (not (and (= v_~y~0_272 2) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:53:03,015 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b01a628f-af77-4714-85a9-49a4655ae369/bin/uautomizer/witness.graphml [2019-12-07 17:53:03,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:53:03,016 INFO L168 Benchmark]: Toolchain (without parser) took 45353.83 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 943.5 MB in the beginning and 978.5 MB in the end (delta: -35.0 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 17:53:03,016 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:53:03,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:53:03,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.19 ms. Allocated memory is still 1.1 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 17:53:03,017 INFO L168 Benchmark]: Boogie Preprocessor took 25.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:53:03,017 INFO L168 Benchmark]: RCFGBuilder took 388.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:53:03,018 INFO L168 Benchmark]: TraceAbstraction took 44441.74 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 992.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 17:53:03,018 INFO L168 Benchmark]: Witness Printer took 62.00 ms. Allocated memory is still 4.4 GB. Free memory was 992.0 MB in the beginning and 978.5 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:53:03,019 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 393.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.19 ms. Allocated memory is still 1.1 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. * Boogie Preprocessor took 25.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 388.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44441.74 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 992.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 62.00 ms. Allocated memory is still 4.4 GB. Free memory was 992.0 MB in the beginning and 978.5 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1912, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1913, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1914, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 44.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3726 SDtfs, 6498 SDslu, 11878 SDs, 0 SdLazy, 7468 SolverSat, 338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 28 SyntacticMatches, 13 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114218occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 87094 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 919 NumberOfCodeBlocks, 919 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 840 ConstructedInterpolants, 0 QuantifiedInterpolants, 289262 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...