./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe024_power.oepc.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_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe024_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/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 78937b95d4b608073969aa786fb5382fe4845a0c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:58:34,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:58:34,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:58:34,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:58:34,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:58:34,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:58:34,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:58:34,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:58:34,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:58:34,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:58:34,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:58:34,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:58:34,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:58:34,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:58:34,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:58:34,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:58:34,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:58:34,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:58:34,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:58:34,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:58:34,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:58:34,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:58:34,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:58:34,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:58:34,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:58:34,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:58:34,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:58:34,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:58:34,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:58:34,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:58:34,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:58:34,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:58:34,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:58:34,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:58:34,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:58:34,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:58:34,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:58:34,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:58:34,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:58:34,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:58:34,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:58:34,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:58:34,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:58:34,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:58:34,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:58:34,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:58:34,400 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:58:34,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:58:34,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:58:34,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:58:34,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:58:34,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:58:34,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:58:34,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:58:34,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:58:34,401 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:58:34,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:58:34,401 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:58:34,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:58:34,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:58:34,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:58:34,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:58:34,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:58:34,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:58:34,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:58:34,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:58:34,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:58:34,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:58:34,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:58:34,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:58:34,402 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:58:34,402 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_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/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 -> 78937b95d4b608073969aa786fb5382fe4845a0c [2019-12-07 14:58:34,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:58:34,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:58:34,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:58:34,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:58:34,519 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:58:34,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe024_power.oepc.i [2019-12-07 14:58:34,565 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/data/c3b2a7ea8/27d853e9e9bb4f01878f08063ed34254/FLAGf830d9460 [2019-12-07 14:58:35,023 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:58:35,023 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/sv-benchmarks/c/pthread-wmm/safe024_power.oepc.i [2019-12-07 14:58:35,033 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/data/c3b2a7ea8/27d853e9e9bb4f01878f08063ed34254/FLAGf830d9460 [2019-12-07 14:58:35,043 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/data/c3b2a7ea8/27d853e9e9bb4f01878f08063ed34254 [2019-12-07 14:58:35,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:58:35,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:58:35,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:58:35,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:58:35,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:58:35,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35, skipping insertion in model container [2019-12-07 14:58:35,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:58:35,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:58:35,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:58:35,336 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:58:35,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:58:35,420 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:58:35,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35 WrapperNode [2019-12-07 14:58:35,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:58:35,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:58:35,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:58:35,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:58:35,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:58:35,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:58:35,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:58:35,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:58:35,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... [2019-12-07 14:58:35,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:58:35,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:58:35,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:58:35,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:58:35,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/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 14:58:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:58:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:58:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:58:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:58:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:58:35,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:58:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:58:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:58:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:58:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:58:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:58:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:58:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:58:35,529 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 14:58:35,887 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:58:35,887 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:58:35,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:58:35 BoogieIcfgContainer [2019-12-07 14:58:35,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:58:35,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:58:35,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:58:35,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:58:35,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:58:35" (1/3) ... [2019-12-07 14:58:35,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8e8e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:58:35, skipping insertion in model container [2019-12-07 14:58:35,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:58:35" (2/3) ... [2019-12-07 14:58:35,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8e8e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:58:35, skipping insertion in model container [2019-12-07 14:58:35,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:58:35" (3/3) ... [2019-12-07 14:58:35,893 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc.i [2019-12-07 14:58:35,900 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:58:35,900 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:58:35,905 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:58:35,906 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:58:35,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:58:35,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:58:35,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:58:35,983 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:58:35,983 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:58:35,983 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:58:35,983 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:58:35,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:58:35,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:58:35,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:58:35,996 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 14:58:35,997 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 14:58:36,056 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 14:58:36,057 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:58:36,068 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 14:58:36,082 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 14:58:36,118 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 14:58:36,118 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:58:36,124 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 14:58:36,139 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 14:58:36,140 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:58:39,234 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 14:58:39,338 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-07 14:58:39,338 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 14:58:39,341 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-07 14:58:49,700 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 14:58:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 14:58:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:58:49,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:49,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:58:49,706 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 14:58:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-07 14:58:49,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:58:49,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180244971] [2019-12-07 14:58:49,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:58:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:58:49,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180244971] [2019-12-07 14:58:49,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:49,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:58:49,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405505254] [2019-12-07 14:58:49,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:58:49,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:58:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:58:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:58:49,880 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 14:58:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:50,480 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-07 14:58:50,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:58:50,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:58:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:51,042 INFO L225 Difference]: With dead ends: 87834 [2019-12-07 14:58:51,042 INFO L226 Difference]: Without dead ends: 82738 [2019-12-07 14:58:51,043 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 14:58:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-07 14:58:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-07 14:58:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-07 14:58:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-07 14:58:56,069 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-07 14:58:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:56,069 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-07 14:58:56,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:58:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-07 14:58:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:58:56,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:56,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:58:56,076 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 14:58:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-07 14:58:56,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:58:56,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941769701] [2019-12-07 14:58:56,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:58:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:56,149 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 14:58:56,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941769701] [2019-12-07 14:58:56,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:56,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:58:56,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230874858] [2019-12-07 14:58:56,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:58:56,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:58:56,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:58:56,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:58:56,151 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-07 14:58:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:58,254 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-07 14:58:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:58:58,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:58:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:58,714 INFO L225 Difference]: With dead ends: 127286 [2019-12-07 14:58:58,714 INFO L226 Difference]: Without dead ends: 127202 [2019-12-07 14:58:58,715 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 14:59:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-07 14:59:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-07 14:59:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-07 14:59:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-07 14:59:04,827 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-07 14:59:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:04,828 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-07 14:59:04,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:59:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-07 14:59:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:59:04,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:04,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:04,832 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 14:59:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-07 14:59:04,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:04,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8217323] [2019-12-07 14:59:04,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:04,866 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 14:59:04,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8217323] [2019-12-07 14:59:04,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:04,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:59:04,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995664500] [2019-12-07 14:59:04,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:59:04,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:04,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:59:04,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:59:04,867 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-07 14:59:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:04,954 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-07 14:59:04,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:59:04,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 14:59:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:05,003 INFO L225 Difference]: With dead ends: 28492 [2019-12-07 14:59:05,003 INFO L226 Difference]: Without dead ends: 28492 [2019-12-07 14:59:05,004 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 14:59:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-07 14:59:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-07 14:59:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-07 14:59:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-07 14:59:05,525 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-07 14:59:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:05,526 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-07 14:59:05,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:59:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-07 14:59:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:59:05,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:05,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:05,527 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 14:59:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-07 14:59:05,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:05,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004400106] [2019-12-07 14:59:05,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:05,586 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 14:59:05,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004400106] [2019-12-07 14:59:05,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:05,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:59:05,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967821672] [2019-12-07 14:59:05,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:59:05,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:59:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:05,587 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-07 14:59:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:06,155 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-07 14:59:06,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:59:06,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 14:59:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:06,216 INFO L225 Difference]: With dead ends: 41156 [2019-12-07 14:59:06,216 INFO L226 Difference]: Without dead ends: 41141 [2019-12-07 14:59:06,216 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 14:59:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-07 14:59:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-07 14:59:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-07 14:59:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-07 14:59:06,840 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-07 14:59:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:06,840 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-07 14:59:06,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:59:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-07 14:59:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:59:06,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:06,848 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 14:59:06,848 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 14:59:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-07 14:59:06,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:06,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100589664] [2019-12-07 14:59:06,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:06,915 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 14:59:06,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100589664] [2019-12-07 14:59:06,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:06,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:59:06,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832338284] [2019-12-07 14:59:06,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:06,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:06,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:06,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:59:06,916 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-07 14:59:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:07,515 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-07 14:59:07,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:59:07,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 14:59:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:07,587 INFO L225 Difference]: With dead ends: 48363 [2019-12-07 14:59:07,587 INFO L226 Difference]: Without dead ends: 48336 [2019-12-07 14:59:07,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:59:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-07 14:59:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-07 14:59:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-07 14:59:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-07 14:59:08,289 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-07 14:59:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:08,289 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-07 14:59:08,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-07 14:59:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:59:08,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:08,302 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 14:59:08,302 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 14:59:08,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:08,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-07 14:59:08,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:08,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133581822] [2019-12-07 14:59:08,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:08,374 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 14:59:08,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133581822] [2019-12-07 14:59:08,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:08,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:59:08,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733388915] [2019-12-07 14:59:08,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:59:08,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:59:08,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:08,376 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 5 states. [2019-12-07 14:59:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:08,734 INFO L93 Difference]: Finished difference Result 44326 states and 144194 transitions. [2019-12-07 14:59:08,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:59:08,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 14:59:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:08,801 INFO L225 Difference]: With dead ends: 44326 [2019-12-07 14:59:08,802 INFO L226 Difference]: Without dead ends: 44303 [2019-12-07 14:59:08,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:59:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44303 states. [2019-12-07 14:59:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44303 to 37268. [2019-12-07 14:59:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37268 states. [2019-12-07 14:59:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37268 states to 37268 states and 122134 transitions. [2019-12-07 14:59:09,683 INFO L78 Accepts]: Start accepts. Automaton has 37268 states and 122134 transitions. Word has length 25 [2019-12-07 14:59:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:09,684 INFO L462 AbstractCegarLoop]: Abstraction has 37268 states and 122134 transitions. [2019-12-07 14:59:09,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:59:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 37268 states and 122134 transitions. [2019-12-07 14:59:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:59:09,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:09,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:09,696 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 14:59:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash -353872392, now seen corresponding path program 1 times [2019-12-07 14:59:09,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:09,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046237202] [2019-12-07 14:59:09,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:09,738 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 14:59:09,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046237202] [2019-12-07 14:59:09,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:09,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:59:09,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529835073] [2019-12-07 14:59:09,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:59:09,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:59:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:59:09,740 INFO L87 Difference]: Start difference. First operand 37268 states and 122134 transitions. Second operand 4 states. [2019-12-07 14:59:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:09,784 INFO L93 Difference]: Finished difference Result 13778 states and 41802 transitions. [2019-12-07 14:59:09,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:59:09,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 14:59:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:09,800 INFO L225 Difference]: With dead ends: 13778 [2019-12-07 14:59:09,801 INFO L226 Difference]: Without dead ends: 13778 [2019-12-07 14:59:09,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:59:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2019-12-07 14:59:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 13498. [2019-12-07 14:59:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13498 states. [2019-12-07 14:59:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13498 states to 13498 states and 40957 transitions. [2019-12-07 14:59:09,997 INFO L78 Accepts]: Start accepts. Automaton has 13498 states and 40957 transitions. Word has length 27 [2019-12-07 14:59:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:09,998 INFO L462 AbstractCegarLoop]: Abstraction has 13498 states and 40957 transitions. [2019-12-07 14:59:09,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:59:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 13498 states and 40957 transitions. [2019-12-07 14:59:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:59:10,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:10,016 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 14:59:10,016 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 14:59:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-07 14:59:10,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:10,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304508876] [2019-12-07 14:59:10,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:10,102 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 14:59:10,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304508876] [2019-12-07 14:59:10,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:10,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:59:10,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364524090] [2019-12-07 14:59:10,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:59:10,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:59:10,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:59:10,103 INFO L87 Difference]: Start difference. First operand 13498 states and 40957 transitions. Second operand 7 states. [2019-12-07 14:59:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:10,787 INFO L93 Difference]: Finished difference Result 16601 states and 49016 transitions. [2019-12-07 14:59:10,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 14:59:10,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-07 14:59:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:10,805 INFO L225 Difference]: With dead ends: 16601 [2019-12-07 14:59:10,805 INFO L226 Difference]: Without dead ends: 16597 [2019-12-07 14:59:10,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:59:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16597 states. [2019-12-07 14:59:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16597 to 12946. [2019-12-07 14:59:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12946 states. [2019-12-07 14:59:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12946 states to 12946 states and 39222 transitions. [2019-12-07 14:59:11,011 INFO L78 Accepts]: Start accepts. Automaton has 12946 states and 39222 transitions. Word has length 39 [2019-12-07 14:59:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:11,012 INFO L462 AbstractCegarLoop]: Abstraction has 12946 states and 39222 transitions. [2019-12-07 14:59:11,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:59:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 12946 states and 39222 transitions. [2019-12-07 14:59:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:59:11,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:11,028 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 14:59:11,028 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 14:59:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1774277701, now seen corresponding path program 1 times [2019-12-07 14:59:11,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:11,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761156792] [2019-12-07 14:59:11,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:11,075 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 14:59:11,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761156792] [2019-12-07 14:59:11,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:11,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:59:11,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247713976] [2019-12-07 14:59:11,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:59:11,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:11,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:59:11,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:11,077 INFO L87 Difference]: Start difference. First operand 12946 states and 39222 transitions. Second operand 5 states. [2019-12-07 14:59:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:11,396 INFO L93 Difference]: Finished difference Result 18396 states and 55230 transitions. [2019-12-07 14:59:11,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:11,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 14:59:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:11,423 INFO L225 Difference]: With dead ends: 18396 [2019-12-07 14:59:11,423 INFO L226 Difference]: Without dead ends: 18396 [2019-12-07 14:59:11,423 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 14:59:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18396 states. [2019-12-07 14:59:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18396 to 17106. [2019-12-07 14:59:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17106 states. [2019-12-07 14:59:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17106 states to 17106 states and 51647 transitions. [2019-12-07 14:59:11,678 INFO L78 Accepts]: Start accepts. Automaton has 17106 states and 51647 transitions. Word has length 39 [2019-12-07 14:59:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:11,679 INFO L462 AbstractCegarLoop]: Abstraction has 17106 states and 51647 transitions. [2019-12-07 14:59:11,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:59:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 17106 states and 51647 transitions. [2019-12-07 14:59:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:59:11,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:11,702 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 14:59:11,702 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 14:59:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1535710989, now seen corresponding path program 2 times [2019-12-07 14:59:11,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:11,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682061612] [2019-12-07 14:59:11,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:11,762 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 14:59:11,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682061612] [2019-12-07 14:59:11,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:11,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:59:11,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840639278] [2019-12-07 14:59:11,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:11,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:59:11,763 INFO L87 Difference]: Start difference. First operand 17106 states and 51647 transitions. Second operand 6 states. [2019-12-07 14:59:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:12,229 INFO L93 Difference]: Finished difference Result 29522 states and 89265 transitions. [2019-12-07 14:59:12,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:59:12,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 14:59:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:12,265 INFO L225 Difference]: With dead ends: 29522 [2019-12-07 14:59:12,266 INFO L226 Difference]: Without dead ends: 29522 [2019-12-07 14:59:12,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:59:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29522 states. [2019-12-07 14:59:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29522 to 19234. [2019-12-07 14:59:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19234 states. [2019-12-07 14:59:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19234 states to 19234 states and 58280 transitions. [2019-12-07 14:59:12,627 INFO L78 Accepts]: Start accepts. Automaton has 19234 states and 58280 transitions. Word has length 39 [2019-12-07 14:59:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:12,628 INFO L462 AbstractCegarLoop]: Abstraction has 19234 states and 58280 transitions. [2019-12-07 14:59:12,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 19234 states and 58280 transitions. [2019-12-07 14:59:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:59:12,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:12,645 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 14:59:12,645 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 14:59:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2031506743, now seen corresponding path program 3 times [2019-12-07 14:59:12,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:12,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895674989] [2019-12-07 14:59:12,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:12,712 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 14:59:12,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895674989] [2019-12-07 14:59:12,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:12,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:59:12,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427238345] [2019-12-07 14:59:12,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:12,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:12,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:12,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:59:12,714 INFO L87 Difference]: Start difference. First operand 19234 states and 58280 transitions. Second operand 6 states. [2019-12-07 14:59:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:13,287 INFO L93 Difference]: Finished difference Result 25298 states and 75440 transitions. [2019-12-07 14:59:13,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:59:13,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 14:59:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:13,316 INFO L225 Difference]: With dead ends: 25298 [2019-12-07 14:59:13,316 INFO L226 Difference]: Without dead ends: 25298 [2019-12-07 14:59:13,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:59:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25298 states. [2019-12-07 14:59:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25298 to 19803. [2019-12-07 14:59:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19803 states. [2019-12-07 14:59:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19803 states to 19803 states and 60013 transitions. [2019-12-07 14:59:13,648 INFO L78 Accepts]: Start accepts. Automaton has 19803 states and 60013 transitions. Word has length 39 [2019-12-07 14:59:13,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:13,648 INFO L462 AbstractCegarLoop]: Abstraction has 19803 states and 60013 transitions. [2019-12-07 14:59:13,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 19803 states and 60013 transitions. [2019-12-07 14:59:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:59:13,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:13,666 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 14:59:13,666 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 14:59:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2139225727, now seen corresponding path program 4 times [2019-12-07 14:59:13,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:13,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036901652] [2019-12-07 14:59:13,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:13,733 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 14:59:13,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036901652] [2019-12-07 14:59:13,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:13,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:59:13,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244964603] [2019-12-07 14:59:13,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:59:13,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:13,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:59:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:59:13,735 INFO L87 Difference]: Start difference. First operand 19803 states and 60013 transitions. Second operand 7 states. [2019-12-07 14:59:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:14,377 INFO L93 Difference]: Finished difference Result 31271 states and 94236 transitions. [2019-12-07 14:59:14,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:59:14,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-07 14:59:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:14,414 INFO L225 Difference]: With dead ends: 31271 [2019-12-07 14:59:14,415 INFO L226 Difference]: Without dead ends: 31271 [2019-12-07 14:59:14,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:59:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31271 states. [2019-12-07 14:59:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31271 to 19844. [2019-12-07 14:59:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19844 states. [2019-12-07 14:59:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19844 states to 19844 states and 60138 transitions. [2019-12-07 14:59:14,776 INFO L78 Accepts]: Start accepts. Automaton has 19844 states and 60138 transitions. Word has length 39 [2019-12-07 14:59:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:14,777 INFO L462 AbstractCegarLoop]: Abstraction has 19844 states and 60138 transitions. [2019-12-07 14:59:14,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:59:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 19844 states and 60138 transitions. [2019-12-07 14:59:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:59:14,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:14,796 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 14:59:14,796 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 14:59:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:14,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1287051898, now seen corresponding path program 1 times [2019-12-07 14:59:14,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:14,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238214916] [2019-12-07 14:59:14,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:14,830 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 14:59:14,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238214916] [2019-12-07 14:59:14,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:14,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:59:14,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959332107] [2019-12-07 14:59:14,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:59:14,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:14,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:59:14,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:14,831 INFO L87 Difference]: Start difference. First operand 19844 states and 60138 transitions. Second operand 5 states. [2019-12-07 14:59:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:14,891 INFO L93 Difference]: Finished difference Result 18169 states and 55940 transitions. [2019-12-07 14:59:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:59:14,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 14:59:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:14,912 INFO L225 Difference]: With dead ends: 18169 [2019-12-07 14:59:14,912 INFO L226 Difference]: Without dead ends: 18169 [2019-12-07 14:59:14,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states. [2019-12-07 14:59:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 16499. [2019-12-07 14:59:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16499 states. [2019-12-07 14:59:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16499 states to 16499 states and 51049 transitions. [2019-12-07 14:59:15,173 INFO L78 Accepts]: Start accepts. Automaton has 16499 states and 51049 transitions. Word has length 40 [2019-12-07 14:59:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:15,173 INFO L462 AbstractCegarLoop]: Abstraction has 16499 states and 51049 transitions. [2019-12-07 14:59:15,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:59:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 16499 states and 51049 transitions. [2019-12-07 14:59:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:59:15,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:15,189 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] [2019-12-07 14:59:15,189 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 14:59:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash 814608255, now seen corresponding path program 1 times [2019-12-07 14:59:15,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:15,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354751145] [2019-12-07 14:59:15,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:15,244 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 14:59:15,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354751145] [2019-12-07 14:59:15,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:15,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:59:15,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944228150] [2019-12-07 14:59:15,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:59:15,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:15,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:59:15,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:15,245 INFO L87 Difference]: Start difference. First operand 16499 states and 51049 transitions. Second operand 5 states. [2019-12-07 14:59:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:15,330 INFO L93 Difference]: Finished difference Result 30247 states and 93607 transitions. [2019-12-07 14:59:15,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:15,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 14:59:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:15,347 INFO L225 Difference]: With dead ends: 30247 [2019-12-07 14:59:15,347 INFO L226 Difference]: Without dead ends: 14329 [2019-12-07 14:59:15,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:59:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14329 states. [2019-12-07 14:59:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14329 to 14329. [2019-12-07 14:59:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14329 states. [2019-12-07 14:59:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14329 states to 14329 states and 44168 transitions. [2019-12-07 14:59:15,553 INFO L78 Accepts]: Start accepts. Automaton has 14329 states and 44168 transitions. Word has length 53 [2019-12-07 14:59:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:15,553 INFO L462 AbstractCegarLoop]: Abstraction has 14329 states and 44168 transitions. [2019-12-07 14:59:15,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:59:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 14329 states and 44168 transitions. [2019-12-07 14:59:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:59:15,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:15,565 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] [2019-12-07 14:59:15,565 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 14:59:15,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:15,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1725911871, now seen corresponding path program 2 times [2019-12-07 14:59:15,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:15,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763915181] [2019-12-07 14:59:15,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:15,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763915181] [2019-12-07 14:59:15,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:15,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:59:15,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905542537] [2019-12-07 14:59:15,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:59:15,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:15,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:59:15,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:59:15,656 INFO L87 Difference]: Start difference. First operand 14329 states and 44168 transitions. Second operand 7 states. [2019-12-07 14:59:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:16,322 INFO L93 Difference]: Finished difference Result 21216 states and 63869 transitions. [2019-12-07 14:59:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 14:59:16,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 14:59:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:16,347 INFO L225 Difference]: With dead ends: 21216 [2019-12-07 14:59:16,347 INFO L226 Difference]: Without dead ends: 21216 [2019-12-07 14:59:16,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:59:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21216 states. [2019-12-07 14:59:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21216 to 15309. [2019-12-07 14:59:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15309 states. [2019-12-07 14:59:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15309 states to 15309 states and 47023 transitions. [2019-12-07 14:59:16,630 INFO L78 Accepts]: Start accepts. Automaton has 15309 states and 47023 transitions. Word has length 53 [2019-12-07 14:59:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:16,630 INFO L462 AbstractCegarLoop]: Abstraction has 15309 states and 47023 transitions. [2019-12-07 14:59:16,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:59:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 15309 states and 47023 transitions. [2019-12-07 14:59:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:59:16,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:16,643 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] [2019-12-07 14:59:16,643 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 14:59:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1206063985, now seen corresponding path program 3 times [2019-12-07 14:59:16,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:16,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23774404] [2019-12-07 14:59:16,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:16,733 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 14:59:16,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23774404] [2019-12-07 14:59:16,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:16,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:59:16,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301634129] [2019-12-07 14:59:16,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:59:16,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:16,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:59:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:59:16,735 INFO L87 Difference]: Start difference. First operand 15309 states and 47023 transitions. Second operand 9 states. [2019-12-07 14:59:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:17,847 INFO L93 Difference]: Finished difference Result 28543 states and 86187 transitions. [2019-12-07 14:59:17,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 14:59:17,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 14:59:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:17,881 INFO L225 Difference]: With dead ends: 28543 [2019-12-07 14:59:17,881 INFO L226 Difference]: Without dead ends: 28543 [2019-12-07 14:59:17,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-07 14:59:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28543 states. [2019-12-07 14:59:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28543 to 14498. [2019-12-07 14:59:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14498 states. [2019-12-07 14:59:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14498 states to 14498 states and 44563 transitions. [2019-12-07 14:59:18,191 INFO L78 Accepts]: Start accepts. Automaton has 14498 states and 44563 transitions. Word has length 53 [2019-12-07 14:59:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:18,191 INFO L462 AbstractCegarLoop]: Abstraction has 14498 states and 44563 transitions. [2019-12-07 14:59:18,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:59:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 14498 states and 44563 transitions. [2019-12-07 14:59:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:59:18,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:18,204 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] [2019-12-07 14:59:18,205 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 14:59:18,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1287405289, now seen corresponding path program 4 times [2019-12-07 14:59:18,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:18,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332529572] [2019-12-07 14:59:18,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:18,246 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 14:59:18,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332529572] [2019-12-07 14:59:18,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:18,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:59:18,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013196911] [2019-12-07 14:59:18,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:59:18,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:18,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:59:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:59:18,248 INFO L87 Difference]: Start difference. First operand 14498 states and 44563 transitions. Second operand 3 states. [2019-12-07 14:59:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:18,285 INFO L93 Difference]: Finished difference Result 13038 states and 39433 transitions. [2019-12-07 14:59:18,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:59:18,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 14:59:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:18,300 INFO L225 Difference]: With dead ends: 13038 [2019-12-07 14:59:18,301 INFO L226 Difference]: Without dead ends: 13038 [2019-12-07 14:59:18,301 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 14:59:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13038 states. [2019-12-07 14:59:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13038 to 12996. [2019-12-07 14:59:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12996 states. [2019-12-07 14:59:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12996 states to 12996 states and 39314 transitions. [2019-12-07 14:59:18,489 INFO L78 Accepts]: Start accepts. Automaton has 12996 states and 39314 transitions. Word has length 53 [2019-12-07 14:59:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:18,489 INFO L462 AbstractCegarLoop]: Abstraction has 12996 states and 39314 transitions. [2019-12-07 14:59:18,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:59:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 12996 states and 39314 transitions. [2019-12-07 14:59:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:59:18,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:18,501 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] [2019-12-07 14:59:18,501 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 14:59:18,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:18,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069858, now seen corresponding path program 1 times [2019-12-07 14:59:18,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:18,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773952497] [2019-12-07 14:59:18,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:18,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 14:59:18,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773952497] [2019-12-07 14:59:18,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:18,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:59:18,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730893455] [2019-12-07 14:59:18,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:59:18,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:18,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:59:18,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:59:18,538 INFO L87 Difference]: Start difference. First operand 12996 states and 39314 transitions. Second operand 3 states. [2019-12-07 14:59:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:18,579 INFO L93 Difference]: Finished difference Result 12994 states and 39309 transitions. [2019-12-07 14:59:18,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:59:18,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 14:59:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:18,594 INFO L225 Difference]: With dead ends: 12994 [2019-12-07 14:59:18,594 INFO L226 Difference]: Without dead ends: 12994 [2019-12-07 14:59:18,594 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 14:59:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12994 states. [2019-12-07 14:59:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12994 to 11525. [2019-12-07 14:59:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11525 states. [2019-12-07 14:59:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11525 states to 11525 states and 35095 transitions. [2019-12-07 14:59:18,770 INFO L78 Accepts]: Start accepts. Automaton has 11525 states and 35095 transitions. Word has length 54 [2019-12-07 14:59:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:18,771 INFO L462 AbstractCegarLoop]: Abstraction has 11525 states and 35095 transitions. [2019-12-07 14:59:18,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:59:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 11525 states and 35095 transitions. [2019-12-07 14:59:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:59:18,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:18,780 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 14:59:18,780 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 14:59:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:18,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 1 times [2019-12-07 14:59:18,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:18,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763546737] [2019-12-07 14:59:18,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:18,943 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 14:59:18,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763546737] [2019-12-07 14:59:18,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:18,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:59:18,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029725326] [2019-12-07 14:59:18,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:59:18,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:59:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:59:18,944 INFO L87 Difference]: Start difference. First operand 11525 states and 35095 transitions. Second operand 11 states. [2019-12-07 14:59:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:19,691 INFO L93 Difference]: Finished difference Result 29549 states and 90458 transitions. [2019-12-07 14:59:19,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 14:59:19,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 14:59:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:19,724 INFO L225 Difference]: With dead ends: 29549 [2019-12-07 14:59:19,725 INFO L226 Difference]: Without dead ends: 28215 [2019-12-07 14:59:19,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 14:59:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28215 states. [2019-12-07 14:59:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28215 to 17790. [2019-12-07 14:59:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17790 states. [2019-12-07 14:59:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17790 states to 17790 states and 54663 transitions. [2019-12-07 14:59:20,074 INFO L78 Accepts]: Start accepts. Automaton has 17790 states and 54663 transitions. Word has length 55 [2019-12-07 14:59:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:20,075 INFO L462 AbstractCegarLoop]: Abstraction has 17790 states and 54663 transitions. [2019-12-07 14:59:20,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:59:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 17790 states and 54663 transitions. [2019-12-07 14:59:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:59:20,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:20,090 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 14:59:20,090 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 14:59:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 2 times [2019-12-07 14:59:20,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:20,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736151769] [2019-12-07 14:59:20,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:20,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736151769] [2019-12-07 14:59:20,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:20,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:59:20,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289982996] [2019-12-07 14:59:20,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:59:20,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:20,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:59:20,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:59:20,201 INFO L87 Difference]: Start difference. First operand 17790 states and 54663 transitions. Second operand 11 states. [2019-12-07 14:59:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:20,779 INFO L93 Difference]: Finished difference Result 28777 states and 87504 transitions. [2019-12-07 14:59:20,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 14:59:20,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 14:59:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:20,798 INFO L225 Difference]: With dead ends: 28777 [2019-12-07 14:59:20,798 INFO L226 Difference]: Without dead ends: 20813 [2019-12-07 14:59:20,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-12-07 14:59:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20813 states. [2019-12-07 14:59:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20813 to 13365. [2019-12-07 14:59:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13365 states. [2019-12-07 14:59:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13365 states to 13365 states and 40102 transitions. [2019-12-07 14:59:21,033 INFO L78 Accepts]: Start accepts. Automaton has 13365 states and 40102 transitions. Word has length 55 [2019-12-07 14:59:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:21,033 INFO L462 AbstractCegarLoop]: Abstraction has 13365 states and 40102 transitions. [2019-12-07 14:59:21,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:59:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 13365 states and 40102 transitions. [2019-12-07 14:59:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:59:21,046 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:21,046 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 14:59:21,046 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 14:59:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 3 times [2019-12-07 14:59:21,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:21,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416342125] [2019-12-07 14:59:21,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:21,197 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 14:59:21,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416342125] [2019-12-07 14:59:21,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:21,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 14:59:21,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793676012] [2019-12-07 14:59:21,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:59:21,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:21,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:59:21,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:59:21,198 INFO L87 Difference]: Start difference. First operand 13365 states and 40102 transitions. Second operand 13 states. [2019-12-07 14:59:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:21,740 INFO L93 Difference]: Finished difference Result 21533 states and 63859 transitions. [2019-12-07 14:59:21,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 14:59:21,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-07 14:59:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:21,762 INFO L225 Difference]: With dead ends: 21533 [2019-12-07 14:59:21,762 INFO L226 Difference]: Without dead ends: 20380 [2019-12-07 14:59:21,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 14:59:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20380 states. [2019-12-07 14:59:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20380 to 12909. [2019-12-07 14:59:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12909 states. [2019-12-07 14:59:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12909 states to 12909 states and 38871 transitions. [2019-12-07 14:59:22,001 INFO L78 Accepts]: Start accepts. Automaton has 12909 states and 38871 transitions. Word has length 55 [2019-12-07 14:59:22,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:22,002 INFO L462 AbstractCegarLoop]: Abstraction has 12909 states and 38871 transitions. [2019-12-07 14:59:22,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:59:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 12909 states and 38871 transitions. [2019-12-07 14:59:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:59:22,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:22,013 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 14:59:22,014 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 14:59:22,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 4 times [2019-12-07 14:59:22,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:22,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770005152] [2019-12-07 14:59:22,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:59:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:59:22,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:59:22,079 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:59:22,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2345~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| 4)) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24|) 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24| 1) |v_#valid_59|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24|) |v_ULTIMATE.start_main_~#t2345~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= 0 |v_ULTIMATE.start_main_~#t2345~0.offset_18|) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ULTIMATE.start_main_~#t2345~0.offset=|v_ULTIMATE.start_main_~#t2345~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_26|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_26|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, 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_25|, ULTIMATE.start_main_~#t2345~0.base=|v_ULTIMATE.start_main_~#t2345~0.base_24|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2345~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2347~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2346~0.offset, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2346~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2345~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:59:22,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2346~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2346~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13|) |v_ULTIMATE.start_main_~#t2346~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_11|, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2346~0.offset, ULTIMATE.start_main_~#t2346~0.base] because there is no mapped edge [2019-12-07 14:59:22,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2347~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2347~0.base_13| 0)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13|) |v_ULTIMATE.start_main_~#t2347~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2347~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2347~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 14:59:22,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548) (= ~x$w_buff1~0_Out-854036548 ~x$w_buff0~0_In-854036548) (= ~x$w_buff0_used~0_In-854036548 ~x$w_buff1_used~0_Out-854036548) (= (ite (not (and (not (= (mod ~x$w_buff0_used~0_Out-854036548 256) 0)) (not (= (mod ~x$w_buff1_used~0_Out-854036548 256) 0)))) 1 0) |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548|) (= 1 ~x$w_buff0_used~0_Out-854036548) (= |P1Thread1of1ForFork0_#in~arg.base_In-854036548| P1Thread1of1ForFork0_~arg.base_Out-854036548) (= P1Thread1of1ForFork0_~arg.offset_Out-854036548 |P1Thread1of1ForFork0_#in~arg.offset_In-854036548|) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548)) (= 1 ~x$w_buff0~0_Out-854036548)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-854036548, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-854036548|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-854036548|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854036548} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-854036548, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-854036548, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-854036548, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-854036548|, ~x$w_buff1~0=~x$w_buff1~0_Out-854036548, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-854036548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-854036548, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-854036548} 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 14:59:22,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-134735910 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-134735910 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-134735910 |P2Thread1of1ForFork1_#t~ite32_Out-134735910|) (not .cse1)) (and (= ~x~0_In-134735910 |P2Thread1of1ForFork1_#t~ite32_Out-134735910|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-134735910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134735910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-134735910, ~x~0=~x~0_In-134735910} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-134735910|, ~x$w_buff1~0=~x$w_buff1~0_In-134735910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134735910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-134735910, ~x~0=~x~0_In-134735910} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:59:22,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 14:59:22,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1651096095 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1651096095 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out1651096095| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1651096095 |P2Thread1of1ForFork1_#t~ite34_Out1651096095|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1651096095|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:59:22,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1521275523 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1521275523 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1521275523 |P1Thread1of1ForFork0_#t~ite28_Out1521275523|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1521275523|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521275523, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1521275523|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:59:22,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-2069088854 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2069088854 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2069088854 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2069088854 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-2069088854|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2069088854 |P1Thread1of1ForFork0_#t~ite29_Out-2069088854|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2069088854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2069088854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2069088854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2069088854, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2069088854|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:59:22,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In527582238 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out527582238 ~x$r_buff0_thd2~0_In527582238)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In527582238 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out527582238 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out527582238|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:59:22,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In432764255 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In432764255 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In432764255 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In432764255 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out432764255| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out432764255| ~x$r_buff1_thd2~0_In432764255)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In432764255, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out432764255|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In432764255, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:59:22,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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 14:59:22,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-520889407 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-520889407 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-520889407 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-520889407 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-520889407 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite11_Out-520889407| |P0Thread1of1ForFork2_#t~ite12_Out-520889407|) (= ~x$w_buff1~0_In-520889407 |P0Thread1of1ForFork2_#t~ite11_Out-520889407|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite11_In-520889407| |P0Thread1of1ForFork2_#t~ite11_Out-520889407|) (not .cse1) (= ~x$w_buff1~0_In-520889407 |P0Thread1of1ForFork2_#t~ite12_Out-520889407|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520889407, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520889407, ~weak$$choice2~0=~weak$$choice2~0_In-520889407, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-520889407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520889407} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520889407, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520889407, ~weak$$choice2~0=~weak$$choice2~0_In-520889407, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-520889407|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-520889407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520889407} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 14:59:22,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-167876085 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-167876085 256) 0))) (or (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-167876085 256) 0)) (= (mod ~x$w_buff0_used~0_In-167876085 256) 0) (and (= (mod ~x$w_buff1_used~0_In-167876085 256) 0) .cse0))) (= |P0Thread1of1ForFork2_#t~ite14_Out-167876085| |P0Thread1of1ForFork2_#t~ite15_Out-167876085|) .cse1 (= ~x$w_buff0_used~0_In-167876085 |P0Thread1of1ForFork2_#t~ite14_Out-167876085|)) (and (= ~x$w_buff0_used~0_In-167876085 |P0Thread1of1ForFork2_#t~ite15_Out-167876085|) (= |P0Thread1of1ForFork2_#t~ite14_In-167876085| |P0Thread1of1ForFork2_#t~ite14_Out-167876085|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-167876085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-167876085, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-167876085|, ~weak$$choice2~0=~weak$$choice2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-167876085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-167876085|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-167876085, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-167876085|, ~weak$$choice2~0=~weak$$choice2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 14:59:22,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1115521006 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1115521006| |P0Thread1of1ForFork2_#t~ite17_Out1115521006|) (= |P0Thread1of1ForFork2_#t~ite18_Out1115521006| ~x$w_buff1_used~0_In1115521006)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1115521006 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1115521006 256))) (= 0 (mod ~x$w_buff0_used~0_In1115521006 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1115521006 256))))) (= ~x$w_buff1_used~0_In1115521006 |P0Thread1of1ForFork2_#t~ite17_Out1115521006|) (= |P0Thread1of1ForFork2_#t~ite18_Out1115521006| |P0Thread1of1ForFork2_#t~ite17_Out1115521006|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1115521006, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1115521006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1115521006, ~weak$$choice2~0=~weak$$choice2~0_In1115521006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115521006} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1115521006, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1115521006|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1115521006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1115521006, ~weak$$choice2~0=~weak$$choice2~0_In1115521006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115521006} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:59:22,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 14:59:22,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:59:22,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-419535407 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-419535407 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-419535407 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-419535407 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-419535407|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-419535407 |P2Thread1of1ForFork1_#t~ite35_Out-419535407|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-419535407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-419535407, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-419535407|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-419535407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-419535407, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:59:22,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1841090625 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1841090625 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1841090625| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1841090625| ~x$r_buff0_thd3~0_In-1841090625) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1841090625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1841090625} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1841090625|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1841090625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1841090625} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:59:22,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In922949385 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In922949385 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In922949385 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In922949385 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In922949385 |P2Thread1of1ForFork1_#t~ite37_Out922949385|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out922949385|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In922949385, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In922949385, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out922949385|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In922949385, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In922949385, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:59:22,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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 14:59:22,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:59:22,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In262501188 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In262501188 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out262501188| ~x$w_buff1~0_In262501188) (not .cse1)) (and (= ~x~0_In262501188 |ULTIMATE.start_main_#t~ite41_Out262501188|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out262501188|, ~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:59:22,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 14:59:22,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1931844491 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1931844491 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1931844491 |ULTIMATE.start_main_#t~ite43_Out1931844491|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out1931844491|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931844491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931844491} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931844491, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1931844491|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931844491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:59:22,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1411863803 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1411863803 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1411863803 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1411863803 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1411863803|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1411863803 |ULTIMATE.start_main_#t~ite44_Out-1411863803|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1411863803, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1411863803, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1411863803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1411863803, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1411863803, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1411863803, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1411863803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:59:22,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1135533140 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1135533140 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1135533140| ~x$r_buff0_thd0~0_In1135533140) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1135533140|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135533140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135533140, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1135533140|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:59:22,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-490519094 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-490519094 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-490519094 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-490519094 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-490519094| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-490519094 |ULTIMATE.start_main_#t~ite46_Out-490519094|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490519094, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-490519094|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490519094, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:59:22,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 14:59:22,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:59:22 BasicIcfg [2019-12-07 14:59:22,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:59:22,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:59:22,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:59:22,139 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:59:22,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:58:35" (3/4) ... [2019-12-07 14:59:22,141 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:59:22,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2345~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| 4)) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24|) 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24| 1) |v_#valid_59|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24|) |v_ULTIMATE.start_main_~#t2345~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= 0 |v_ULTIMATE.start_main_~#t2345~0.offset_18|) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ULTIMATE.start_main_~#t2345~0.offset=|v_ULTIMATE.start_main_~#t2345~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_26|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_26|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, 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_25|, ULTIMATE.start_main_~#t2345~0.base=|v_ULTIMATE.start_main_~#t2345~0.base_24|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2345~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2347~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2346~0.offset, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2346~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2345~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:59:22,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2346~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2346~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13|) |v_ULTIMATE.start_main_~#t2346~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_11|, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2346~0.offset, ULTIMATE.start_main_~#t2346~0.base] because there is no mapped edge [2019-12-07 14:59:22,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2347~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2347~0.base_13| 0)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13|) |v_ULTIMATE.start_main_~#t2347~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2347~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2347~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 14:59:22,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548) (= ~x$w_buff1~0_Out-854036548 ~x$w_buff0~0_In-854036548) (= ~x$w_buff0_used~0_In-854036548 ~x$w_buff1_used~0_Out-854036548) (= (ite (not (and (not (= (mod ~x$w_buff0_used~0_Out-854036548 256) 0)) (not (= (mod ~x$w_buff1_used~0_Out-854036548 256) 0)))) 1 0) |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548|) (= 1 ~x$w_buff0_used~0_Out-854036548) (= |P1Thread1of1ForFork0_#in~arg.base_In-854036548| P1Thread1of1ForFork0_~arg.base_Out-854036548) (= P1Thread1of1ForFork0_~arg.offset_Out-854036548 |P1Thread1of1ForFork0_#in~arg.offset_In-854036548|) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548)) (= 1 ~x$w_buff0~0_Out-854036548)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-854036548, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-854036548|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-854036548|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854036548} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-854036548, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-854036548, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-854036548, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-854036548|, ~x$w_buff1~0=~x$w_buff1~0_Out-854036548, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-854036548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-854036548, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-854036548} 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 14:59:22,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-134735910 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-134735910 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-134735910 |P2Thread1of1ForFork1_#t~ite32_Out-134735910|) (not .cse1)) (and (= ~x~0_In-134735910 |P2Thread1of1ForFork1_#t~ite32_Out-134735910|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-134735910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134735910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-134735910, ~x~0=~x~0_In-134735910} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-134735910|, ~x$w_buff1~0=~x$w_buff1~0_In-134735910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134735910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-134735910, ~x~0=~x~0_In-134735910} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:59:22,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 14:59:22,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1651096095 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1651096095 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out1651096095| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1651096095 |P2Thread1of1ForFork1_#t~ite34_Out1651096095|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1651096095|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:59:22,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1521275523 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1521275523 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1521275523 |P1Thread1of1ForFork0_#t~ite28_Out1521275523|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1521275523|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521275523, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1521275523|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:59:22,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-2069088854 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2069088854 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2069088854 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2069088854 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-2069088854|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2069088854 |P1Thread1of1ForFork0_#t~ite29_Out-2069088854|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2069088854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2069088854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2069088854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2069088854, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2069088854|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:59:22,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In527582238 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out527582238 ~x$r_buff0_thd2~0_In527582238)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In527582238 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out527582238 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out527582238|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:59:22,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In432764255 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In432764255 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In432764255 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In432764255 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out432764255| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out432764255| ~x$r_buff1_thd2~0_In432764255)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In432764255, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out432764255|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In432764255, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:59:22,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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 14:59:22,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-520889407 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-520889407 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-520889407 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-520889407 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-520889407 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite11_Out-520889407| |P0Thread1of1ForFork2_#t~ite12_Out-520889407|) (= ~x$w_buff1~0_In-520889407 |P0Thread1of1ForFork2_#t~ite11_Out-520889407|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite11_In-520889407| |P0Thread1of1ForFork2_#t~ite11_Out-520889407|) (not .cse1) (= ~x$w_buff1~0_In-520889407 |P0Thread1of1ForFork2_#t~ite12_Out-520889407|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520889407, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520889407, ~weak$$choice2~0=~weak$$choice2~0_In-520889407, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-520889407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520889407} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520889407, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520889407, ~weak$$choice2~0=~weak$$choice2~0_In-520889407, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-520889407|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-520889407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520889407} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 14:59:22,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-167876085 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-167876085 256) 0))) (or (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-167876085 256) 0)) (= (mod ~x$w_buff0_used~0_In-167876085 256) 0) (and (= (mod ~x$w_buff1_used~0_In-167876085 256) 0) .cse0))) (= |P0Thread1of1ForFork2_#t~ite14_Out-167876085| |P0Thread1of1ForFork2_#t~ite15_Out-167876085|) .cse1 (= ~x$w_buff0_used~0_In-167876085 |P0Thread1of1ForFork2_#t~ite14_Out-167876085|)) (and (= ~x$w_buff0_used~0_In-167876085 |P0Thread1of1ForFork2_#t~ite15_Out-167876085|) (= |P0Thread1of1ForFork2_#t~ite14_In-167876085| |P0Thread1of1ForFork2_#t~ite14_Out-167876085|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-167876085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-167876085, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-167876085|, ~weak$$choice2~0=~weak$$choice2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-167876085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-167876085|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-167876085, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-167876085|, ~weak$$choice2~0=~weak$$choice2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 14:59:22,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1115521006 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1115521006| |P0Thread1of1ForFork2_#t~ite17_Out1115521006|) (= |P0Thread1of1ForFork2_#t~ite18_Out1115521006| ~x$w_buff1_used~0_In1115521006)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1115521006 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1115521006 256))) (= 0 (mod ~x$w_buff0_used~0_In1115521006 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1115521006 256))))) (= ~x$w_buff1_used~0_In1115521006 |P0Thread1of1ForFork2_#t~ite17_Out1115521006|) (= |P0Thread1of1ForFork2_#t~ite18_Out1115521006| |P0Thread1of1ForFork2_#t~ite17_Out1115521006|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1115521006, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1115521006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1115521006, ~weak$$choice2~0=~weak$$choice2~0_In1115521006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115521006} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1115521006, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1115521006|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1115521006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1115521006, ~weak$$choice2~0=~weak$$choice2~0_In1115521006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115521006} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:59:22,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 14:59:22,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:59:22,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-419535407 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-419535407 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-419535407 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-419535407 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-419535407|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-419535407 |P2Thread1of1ForFork1_#t~ite35_Out-419535407|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-419535407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-419535407, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-419535407|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-419535407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-419535407, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:59:22,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1841090625 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1841090625 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1841090625| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1841090625| ~x$r_buff0_thd3~0_In-1841090625) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1841090625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1841090625} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1841090625|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1841090625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1841090625} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:59:22,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In922949385 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In922949385 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In922949385 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In922949385 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In922949385 |P2Thread1of1ForFork1_#t~ite37_Out922949385|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out922949385|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In922949385, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In922949385, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out922949385|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In922949385, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In922949385, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:59:22,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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 14:59:22,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:59:22,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In262501188 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In262501188 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out262501188| ~x$w_buff1~0_In262501188) (not .cse1)) (and (= ~x~0_In262501188 |ULTIMATE.start_main_#t~ite41_Out262501188|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out262501188|, ~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:59:22,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 14:59:22,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1931844491 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1931844491 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1931844491 |ULTIMATE.start_main_#t~ite43_Out1931844491|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out1931844491|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931844491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931844491} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931844491, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1931844491|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931844491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:59:22,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1411863803 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1411863803 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1411863803 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1411863803 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1411863803|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1411863803 |ULTIMATE.start_main_#t~ite44_Out-1411863803|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1411863803, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1411863803, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1411863803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1411863803, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1411863803, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1411863803, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1411863803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:59:22,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1135533140 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1135533140 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1135533140| ~x$r_buff0_thd0~0_In1135533140) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1135533140|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135533140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135533140, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1135533140|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:59:22,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-490519094 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-490519094 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-490519094 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-490519094 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-490519094| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-490519094 |ULTIMATE.start_main_#t~ite46_Out-490519094|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490519094, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-490519094|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490519094, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:59:22,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 14:59:22,200 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4f6b7e7c-63fc-4fca-91ff-2c6ba4275f11/bin/uautomizer/witness.graphml [2019-12-07 14:59:22,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:59:22,201 INFO L168 Benchmark]: Toolchain (without parser) took 47155.54 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 934.0 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:59:22,201 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:59:22,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:59:22,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.97 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 14:59:22,202 INFO L168 Benchmark]: Boogie Preprocessor took 25.45 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 14:59:22,202 INFO L168 Benchmark]: RCFGBuilder took 403.99 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.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:59:22,203 INFO L168 Benchmark]: TraceAbstraction took 46250.02 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:59:22,203 INFO L168 Benchmark]: Witness Printer took 61.01 ms. Allocated memory is still 4.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:59:22,204 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.97 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.45 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 403.99 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.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46250.02 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 61.01 ms. Allocated memory is still 4.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2345, ((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, z=0] [L822] FCALL, FORK 0 pthread_create(&t2346, ((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, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 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=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, z=0] [L777] 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}, 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, z=0] [L824] FCALL, FORK 0 pthread_create(&t2347, ((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=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, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L797] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1] [L741] 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=0, 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=1, z=1] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 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) [L742] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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 : (!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))=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=0, 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=1, z=1] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=0, 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=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 46.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4346 SDtfs, 6258 SDslu, 14165 SDs, 0 SdLazy, 8727 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 47 SyntacticMatches, 25 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred 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: 17.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 123769 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 764 ConstructedInterpolants, 0 QuantifiedInterpolants, 157818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...