./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_pso.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_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/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 9356c038883eaf32b3f62e36a61d1d73667dc10d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:02:08,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:02:08,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:02:08,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:02:08,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:02:08,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:02:08,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:02:08,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:02:08,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:02:08,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:02:08,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:02:08,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:02:08,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:02:08,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:02:08,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:02:08,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:02:08,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:02:08,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:02:08,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:02:08,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:02:08,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:02:08,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:02:08,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:02:08,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:02:08,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:02:08,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:02:08,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:02:08,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:02:08,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:02:08,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:02:08,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:02:08,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:02:08,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:02:08,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:02:08,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:02:08,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:02:08,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:02:08,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:02:08,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:02:08,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:02:08,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:02:08,735 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:02:08,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:02:08,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:02:08,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:02:08,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:02:08,749 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:02:08,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:02:08,750 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:02:08,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:02:08,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:02:08,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:02:08,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:02:08,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:02:08,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:02:08,751 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:02:08,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:02:08,751 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:02:08,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:02:08,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:02:08,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:02:08,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:02:08,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:02:08,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:02:08,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:02:08,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:02:08,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:02:08,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:02:08,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:02:08,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:02:08,754 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:02:08,754 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_daea46be-816d-4be6-b853-2fd7034f89fc/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 -> 9356c038883eaf32b3f62e36a61d1d73667dc10d [2019-12-07 12:02:08,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:02:08,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:02:08,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:02:08,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:02:08,871 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:02:08,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i [2019-12-07 12:02:08,908 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/data/152b07902/2629073f7a734be5882eba0655e32308/FLAG2fa6b6f14 [2019-12-07 12:02:09,358 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:02:09,358 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i [2019-12-07 12:02:09,368 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/data/152b07902/2629073f7a734be5882eba0655e32308/FLAG2fa6b6f14 [2019-12-07 12:02:09,377 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/data/152b07902/2629073f7a734be5882eba0655e32308 [2019-12-07 12:02:09,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:02:09,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:02:09,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:02:09,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:02:09,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:02:09,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09, skipping insertion in model container [2019-12-07 12:02:09,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:02:09,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:02:09,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:02:09,665 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:02:09,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:02:09,748 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:02:09,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09 WrapperNode [2019-12-07 12:02:09,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:02:09,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:02:09,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:02:09,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:02:09,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:02:09,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:02:09,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:02:09,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:02:09,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... [2019-12-07 12:02:09,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:02:09,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:02:09,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:02:09,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:02:09,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/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 12:02:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:02:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:02:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:02:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:02:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:02:09,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:02:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:02:09,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:02:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:02:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:02:09,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:02:09,860 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 12:02:10,175 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:02:10,175 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:02:10,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:02:10 BoogieIcfgContainer [2019-12-07 12:02:10,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:02:10,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:02:10,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:02:10,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:02:10,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:02:09" (1/3) ... [2019-12-07 12:02:10,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4daaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:02:10, skipping insertion in model container [2019-12-07 12:02:10,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:09" (2/3) ... [2019-12-07 12:02:10,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4daaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:02:10, skipping insertion in model container [2019-12-07 12:02:10,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:02:10" (3/3) ... [2019-12-07 12:02:10,180 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.oepc.i [2019-12-07 12:02:10,186 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:02:10,186 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:02:10,191 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:02:10,191 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:02:10,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,213 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,214 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,228 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,228 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,228 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,229 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,229 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:10,247 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:02:10,263 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:02:10,264 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:02:10,264 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:02:10,264 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:02:10,264 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:02:10,264 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:02:10,264 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:02:10,264 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:02:10,276 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-07 12:02:10,277 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 12:02:10,330 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 12:02:10,331 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:02:10,341 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 12:02:10,351 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 12:02:10,380 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 12:02:10,380 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:02:10,383 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 12:02:10,391 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 12:02:10,392 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:02:12,858 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 12:02:13,002 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-12-07 12:02:13,002 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-07 12:02:13,005 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-12-07 12:02:13,237 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-07 12:02:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-07 12:02:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:02:13,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:13,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:02:13,243 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-12-07 12:02:13,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:13,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782961711] [2019-12-07 12:02:13,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:13,419 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 12:02:13,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782961711] [2019-12-07 12:02:13,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:13,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:02:13,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569452016] [2019-12-07 12:02:13,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:13,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:13,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:13,441 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-07 12:02:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:13,627 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-07 12:02:13,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:13,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:02:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:13,694 INFO L225 Difference]: With dead ends: 6240 [2019-12-07 12:02:13,694 INFO L226 Difference]: Without dead ends: 5850 [2019-12-07 12:02:13,695 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 12:02:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-07 12:02:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-07 12:02:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-07 12:02:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-07 12:02:13,912 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-07 12:02:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:13,913 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-07 12:02:13,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-07 12:02:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:02:13,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:13,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:13,915 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-12-07 12:02:13,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:13,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524612283] [2019-12-07 12:02:13,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:13,970 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 12:02:13,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524612283] [2019-12-07 12:02:13,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:13,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:13,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273223276] [2019-12-07 12:02:13,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:02:13,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:13,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:02:13,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:02:13,972 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 4 states. [2019-12-07 12:02:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:14,204 INFO L93 Difference]: Finished difference Result 9088 states and 29317 transitions. [2019-12-07 12:02:14,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:02:14,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:02:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:14,261 INFO L225 Difference]: With dead ends: 9088 [2019-12-07 12:02:14,261 INFO L226 Difference]: Without dead ends: 9073 [2019-12-07 12:02:14,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:02:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2019-12-07 12:02:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 8163. [2019-12-07 12:02:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8163 states. [2019-12-07 12:02:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 26811 transitions. [2019-12-07 12:02:14,501 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 26811 transitions. Word has length 11 [2019-12-07 12:02:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:14,501 INFO L462 AbstractCegarLoop]: Abstraction has 8163 states and 26811 transitions. [2019-12-07 12:02:14,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:02:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 26811 transitions. [2019-12-07 12:02:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:02:14,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:14,506 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:14,506 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-12-07 12:02:14,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:14,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871105726] [2019-12-07 12:02:14,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:14,553 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 12:02:14,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871105726] [2019-12-07 12:02:14,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:14,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:02:14,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437551252] [2019-12-07 12:02:14,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:14,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:14,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:14,555 INFO L87 Difference]: Start difference. First operand 8163 states and 26811 transitions. Second operand 3 states. [2019-12-07 12:02:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:14,616 INFO L93 Difference]: Finished difference Result 10304 states and 33095 transitions. [2019-12-07 12:02:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:14,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 12:02:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:14,639 INFO L225 Difference]: With dead ends: 10304 [2019-12-07 12:02:14,639 INFO L226 Difference]: Without dead ends: 10304 [2019-12-07 12:02:14,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10304 states. [2019-12-07 12:02:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10304 to 8837. [2019-12-07 12:02:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8837 states. [2019-12-07 12:02:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 28865 transitions. [2019-12-07 12:02:14,849 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 28865 transitions. Word has length 14 [2019-12-07 12:02:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:14,849 INFO L462 AbstractCegarLoop]: Abstraction has 8837 states and 28865 transitions. [2019-12-07 12:02:14,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 28865 transitions. [2019-12-07 12:02:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:02:14,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:14,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:14,851 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:14,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-12-07 12:02:14,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:14,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140589203] [2019-12-07 12:02:14,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:14,889 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 12:02:14,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140589203] [2019-12-07 12:02:14,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:14,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:14,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507904941] [2019-12-07 12:02:14,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:02:14,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:14,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:02:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:02:14,891 INFO L87 Difference]: Start difference. First operand 8837 states and 28865 transitions. Second operand 4 states. [2019-12-07 12:02:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:15,002 INFO L93 Difference]: Finished difference Result 10707 states and 34201 transitions. [2019-12-07 12:02:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:02:15,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:02:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:15,020 INFO L225 Difference]: With dead ends: 10707 [2019-12-07 12:02:15,020 INFO L226 Difference]: Without dead ends: 10697 [2019-12-07 12:02:15,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:02:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10697 states. [2019-12-07 12:02:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10697 to 9298. [2019-12-07 12:02:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9298 states. [2019-12-07 12:02:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 30231 transitions. [2019-12-07 12:02:15,193 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 30231 transitions. Word has length 14 [2019-12-07 12:02:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:15,193 INFO L462 AbstractCegarLoop]: Abstraction has 9298 states and 30231 transitions. [2019-12-07 12:02:15,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:02:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 30231 transitions. [2019-12-07 12:02:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:02:15,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:15,194 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:15,194 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-12-07 12:02:15,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:15,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605325441] [2019-12-07 12:02:15,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02: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 12:02:15,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605325441] [2019-12-07 12:02:15,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:15,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:15,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518545043] [2019-12-07 12:02:15,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:02:15,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:15,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:02:15,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:02:15,246 INFO L87 Difference]: Start difference. First operand 9298 states and 30231 transitions. Second operand 4 states. [2019-12-07 12:02:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:15,376 INFO L93 Difference]: Finished difference Result 11850 states and 37991 transitions. [2019-12-07 12:02:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:02:15,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:02:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:15,392 INFO L225 Difference]: With dead ends: 11850 [2019-12-07 12:02:15,392 INFO L226 Difference]: Without dead ends: 11835 [2019-12-07 12:02:15,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:02:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2019-12-07 12:02:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 9707. [2019-12-07 12:02:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9707 states. [2019-12-07 12:02:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31642 transitions. [2019-12-07 12:02:15,599 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31642 transitions. Word has length 14 [2019-12-07 12:02:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:15,600 INFO L462 AbstractCegarLoop]: Abstraction has 9707 states and 31642 transitions. [2019-12-07 12:02:15,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:02:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31642 transitions. [2019-12-07 12:02:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:02:15,603 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:15,603 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:15,603 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash -247442678, now seen corresponding path program 1 times [2019-12-07 12:02:15,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:15,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011377545] [2019-12-07 12:02:15,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:15,655 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 12:02:15,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011377545] [2019-12-07 12:02:15,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:15,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:02:15,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528317574] [2019-12-07 12:02:15,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:15,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:15,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:15,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:15,656 INFO L87 Difference]: Start difference. First operand 9707 states and 31642 transitions. Second operand 3 states. [2019-12-07 12:02:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:15,714 INFO L93 Difference]: Finished difference Result 16633 states and 53921 transitions. [2019-12-07 12:02:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:15,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:02:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:15,735 INFO L225 Difference]: With dead ends: 16633 [2019-12-07 12:02:15,735 INFO L226 Difference]: Without dead ends: 15969 [2019-12-07 12:02:15,735 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 12:02:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15969 states. [2019-12-07 12:02:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15969 to 15370. [2019-12-07 12:02:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15370 states. [2019-12-07 12:02:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15370 states to 15370 states and 50457 transitions. [2019-12-07 12:02:15,981 INFO L78 Accepts]: Start accepts. Automaton has 15370 states and 50457 transitions. Word has length 16 [2019-12-07 12:02:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:15,981 INFO L462 AbstractCegarLoop]: Abstraction has 15370 states and 50457 transitions. [2019-12-07 12:02:15,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 15370 states and 50457 transitions. [2019-12-07 12:02:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:02:15,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:15,986 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:15,986 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:15,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:15,986 INFO L82 PathProgramCache]: Analyzing trace with hash 101415142, now seen corresponding path program 1 times [2019-12-07 12:02:15,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:15,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577601883] [2019-12-07 12:02:15,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:16,012 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 12:02:16,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577601883] [2019-12-07 12:02:16,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:16,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:16,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925916698] [2019-12-07 12:02:16,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:16,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:16,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:16,013 INFO L87 Difference]: Start difference. First operand 15370 states and 50457 transitions. Second operand 3 states. [2019-12-07 12:02:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:16,025 INFO L93 Difference]: Finished difference Result 2259 states and 5457 transitions. [2019-12-07 12:02:16,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:16,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:02:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:16,028 INFO L225 Difference]: With dead ends: 2259 [2019-12-07 12:02:16,028 INFO L226 Difference]: Without dead ends: 2259 [2019-12-07 12:02:16,028 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 12:02:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-12-07 12:02:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2259. [2019-12-07 12:02:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-12-07 12:02:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 5457 transitions. [2019-12-07 12:02:16,052 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 5457 transitions. Word has length 17 [2019-12-07 12:02:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:16,053 INFO L462 AbstractCegarLoop]: Abstraction has 2259 states and 5457 transitions. [2019-12-07 12:02:16,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 5457 transitions. [2019-12-07 12:02:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:02:16,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:16,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:16,055 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-12-07 12:02:16,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:16,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234557315] [2019-12-07 12:02:16,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:16,093 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 12:02:16,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234557315] [2019-12-07 12:02:16,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:16,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:02:16,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598335877] [2019-12-07 12:02:16,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:02:16,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:16,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:02:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:02:16,094 INFO L87 Difference]: Start difference. First operand 2259 states and 5457 transitions. Second operand 5 states. [2019-12-07 12:02:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:16,204 INFO L93 Difference]: Finished difference Result 2836 states and 6733 transitions. [2019-12-07 12:02:16,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:02:16,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 12:02:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:16,206 INFO L225 Difference]: With dead ends: 2836 [2019-12-07 12:02:16,206 INFO L226 Difference]: Without dead ends: 2834 [2019-12-07 12:02:16,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:02:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2019-12-07 12:02:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2371. [2019-12-07 12:02:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2371 states. [2019-12-07 12:02:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 5691 transitions. [2019-12-07 12:02:16,229 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 5691 transitions. Word has length 26 [2019-12-07 12:02:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:16,229 INFO L462 AbstractCegarLoop]: Abstraction has 2371 states and 5691 transitions. [2019-12-07 12:02:16,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:02:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 5691 transitions. [2019-12-07 12:02:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:02:16,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:16,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:16,231 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:16,232 INFO L82 PathProgramCache]: Analyzing trace with hash -344365836, now seen corresponding path program 1 times [2019-12-07 12:02:16,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:16,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581587004] [2019-12-07 12:02:16,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:16,249 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 12:02:16,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581587004] [2019-12-07 12:02:16,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:16,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:02:16,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809401500] [2019-12-07 12:02:16,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:16,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:16,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:16,251 INFO L87 Difference]: Start difference. First operand 2371 states and 5691 transitions. Second operand 3 states. [2019-12-07 12:02:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:16,296 INFO L93 Difference]: Finished difference Result 2903 states and 6731 transitions. [2019-12-07 12:02:16,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:16,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 12:02:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:16,298 INFO L225 Difference]: With dead ends: 2903 [2019-12-07 12:02:16,299 INFO L226 Difference]: Without dead ends: 2903 [2019-12-07 12:02:16,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2019-12-07 12:02:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2447. [2019-12-07 12:02:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-12-07 12:02:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 5619 transitions. [2019-12-07 12:02:16,321 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 5619 transitions. Word has length 26 [2019-12-07 12:02:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:16,321 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 5619 transitions. [2019-12-07 12:02:16,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 5619 transitions. [2019-12-07 12:02:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:02:16,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:16,323 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 12:02:16,323 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1359644488, now seen corresponding path program 1 times [2019-12-07 12:02:16,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:16,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357574329] [2019-12-07 12:02:16,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:16,361 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 12:02:16,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357574329] [2019-12-07 12:02:16,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:16,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:02:16,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465907175] [2019-12-07 12:02:16,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:02:16,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:16,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:02:16,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:02:16,363 INFO L87 Difference]: Start difference. First operand 2447 states and 5619 transitions. Second operand 5 states. [2019-12-07 12:02:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:16,487 INFO L93 Difference]: Finished difference Result 2863 states and 6552 transitions. [2019-12-07 12:02:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:02:16,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 12:02:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:16,490 INFO L225 Difference]: With dead ends: 2863 [2019-12-07 12:02:16,490 INFO L226 Difference]: Without dead ends: 2861 [2019-12-07 12:02:16,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:02:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-12-07 12:02:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2378. [2019-12-07 12:02:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2019-12-07 12:02:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 5460 transitions. [2019-12-07 12:02:16,513 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 5460 transitions. Word has length 27 [2019-12-07 12:02:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:16,513 INFO L462 AbstractCegarLoop]: Abstraction has 2378 states and 5460 transitions. [2019-12-07 12:02:16,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:02:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 5460 transitions. [2019-12-07 12:02:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:02:16,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:16,515 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 12:02:16,515 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1014196272, now seen corresponding path program 1 times [2019-12-07 12:02:16,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:16,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954005309] [2019-12-07 12:02:16,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:16,560 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 12:02:16,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954005309] [2019-12-07 12:02:16,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:16,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:02:16,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894344860] [2019-12-07 12:02:16,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:02:16,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:02:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:02:16,561 INFO L87 Difference]: Start difference. First operand 2378 states and 5460 transitions. Second operand 5 states. [2019-12-07 12:02:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:16,786 INFO L93 Difference]: Finished difference Result 3582 states and 8048 transitions. [2019-12-07 12:02:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:02:16,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 12:02:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:16,788 INFO L225 Difference]: With dead ends: 3582 [2019-12-07 12:02:16,788 INFO L226 Difference]: Without dead ends: 3582 [2019-12-07 12:02:16,789 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 12:02:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2019-12-07 12:02:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3135. [2019-12-07 12:02:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2019-12-07 12:02:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 7056 transitions. [2019-12-07 12:02:16,815 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 7056 transitions. Word has length 27 [2019-12-07 12:02:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:16,815 INFO L462 AbstractCegarLoop]: Abstraction has 3135 states and 7056 transitions. [2019-12-07 12:02:16,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:02:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 7056 transitions. [2019-12-07 12:02:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:02:16,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:16,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:16,818 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash -607500421, now seen corresponding path program 1 times [2019-12-07 12:02:16,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:16,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084668049] [2019-12-07 12:02:16,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:02:16,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084668049] [2019-12-07 12:02:16,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:16,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:02:16,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186873593] [2019-12-07 12:02:16,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:02:16,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:16,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:02:16,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:02:16,844 INFO L87 Difference]: Start difference. First operand 3135 states and 7056 transitions. Second operand 4 states. [2019-12-07 12:02:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:16,858 INFO L93 Difference]: Finished difference Result 1709 states and 3607 transitions. [2019-12-07 12:02:16,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:02:16,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 12:02:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:16,859 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 12:02:16,859 INFO L226 Difference]: Without dead ends: 1689 [2019-12-07 12:02:16,860 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 12:02:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2019-12-07 12:02:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 923. [2019-12-07 12:02:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-07 12:02:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1940 transitions. [2019-12-07 12:02:16,869 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1940 transitions. Word has length 28 [2019-12-07 12:02:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:16,870 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1940 transitions. [2019-12-07 12:02:16,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:02:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1940 transitions. [2019-12-07 12:02:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:02:16,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:16,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:16,871 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash 562189682, now seen corresponding path program 1 times [2019-12-07 12:02:16,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:16,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272940319] [2019-12-07 12:02:16,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:16,919 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 12:02:16,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272940319] [2019-12-07 12:02:16,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:16,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:02:16,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37145619] [2019-12-07 12:02:16,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:02:16,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:16,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:02:16,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:02:16,920 INFO L87 Difference]: Start difference. First operand 923 states and 1940 transitions. Second operand 5 states. [2019-12-07 12:02:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:17,000 INFO L93 Difference]: Finished difference Result 1110 states and 2294 transitions. [2019-12-07 12:02:17,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:02:17,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 12:02:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:17,001 INFO L225 Difference]: With dead ends: 1110 [2019-12-07 12:02:17,001 INFO L226 Difference]: Without dead ends: 1110 [2019-12-07 12:02:17,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 12:02:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-12-07 12:02:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 945. [2019-12-07 12:02:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-12-07 12:02:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1984 transitions. [2019-12-07 12:02:17,009 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1984 transitions. Word has length 41 [2019-12-07 12:02:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:17,009 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1984 transitions. [2019-12-07 12:02:17,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:02:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1984 transitions. [2019-12-07 12:02:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:02:17,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:17,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:17,011 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2091375240, now seen corresponding path program 2 times [2019-12-07 12:02:17,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:17,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233897068] [2019-12-07 12:02:17,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:17,077 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 12:02:17,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233897068] [2019-12-07 12:02:17,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:17,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:02:17,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480136365] [2019-12-07 12:02:17,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:02:17,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:17,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:02:17,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:02:17,079 INFO L87 Difference]: Start difference. First operand 945 states and 1984 transitions. Second operand 6 states. [2019-12-07 12:02:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:17,234 INFO L93 Difference]: Finished difference Result 3344 states and 6923 transitions. [2019-12-07 12:02:17,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:02:17,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 12:02:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:17,236 INFO L225 Difference]: With dead ends: 3344 [2019-12-07 12:02:17,236 INFO L226 Difference]: Without dead ends: 2201 [2019-12-07 12:02:17,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:02:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2019-12-07 12:02:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1020. [2019-12-07 12:02:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-12-07 12:02:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2127 transitions. [2019-12-07 12:02:17,248 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2127 transitions. Word has length 41 [2019-12-07 12:02:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:17,248 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 2127 transitions. [2019-12-07 12:02:17,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:02:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2127 transitions. [2019-12-07 12:02:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:02:17,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:17,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:17,250 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1129012948, now seen corresponding path program 3 times [2019-12-07 12:02:17,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:17,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206122068] [2019-12-07 12:02:17,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:17,360 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 12:02:17,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206122068] [2019-12-07 12:02:17,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:17,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:02:17,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209525343] [2019-12-07 12:02:17,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:02:17,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:17,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:02:17,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:02:17,361 INFO L87 Difference]: Start difference. First operand 1020 states and 2127 transitions. Second operand 9 states. [2019-12-07 12:02:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:17,761 INFO L93 Difference]: Finished difference Result 1204 states and 2357 transitions. [2019-12-07 12:02:17,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:02:17,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-07 12:02:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:17,762 INFO L225 Difference]: With dead ends: 1204 [2019-12-07 12:02:17,762 INFO L226 Difference]: Without dead ends: 1204 [2019-12-07 12:02:17,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:02:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-12-07 12:02:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 841. [2019-12-07 12:02:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-07 12:02:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1695 transitions. [2019-12-07 12:02:17,770 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1695 transitions. Word has length 41 [2019-12-07 12:02:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:17,770 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1695 transitions. [2019-12-07 12:02:17,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:02:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1695 transitions. [2019-12-07 12:02:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:02:17,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:17,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:17,771 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1290807276, now seen corresponding path program 4 times [2019-12-07 12:02:17,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:17,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765637782] [2019-12-07 12:02:17,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:17,826 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 12:02:17,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765637782] [2019-12-07 12:02:17,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:17,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:02:17,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444175428] [2019-12-07 12:02:17,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:02:17,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:17,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:02:17,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:02:17,827 INFO L87 Difference]: Start difference. First operand 841 states and 1695 transitions. Second operand 6 states. [2019-12-07 12:02:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:18,068 INFO L93 Difference]: Finished difference Result 1045 states and 2074 transitions. [2019-12-07 12:02:18,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:02:18,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 12:02:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:18,069 INFO L225 Difference]: With dead ends: 1045 [2019-12-07 12:02:18,069 INFO L226 Difference]: Without dead ends: 1045 [2019-12-07 12:02:18,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:02:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-07 12:02:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 847. [2019-12-07 12:02:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-07 12:02:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1706 transitions. [2019-12-07 12:02:18,079 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1706 transitions. Word has length 41 [2019-12-07 12:02:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:18,079 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1706 transitions. [2019-12-07 12:02:18,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:02:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1706 transitions. [2019-12-07 12:02:18,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:02:18,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:18,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:18,081 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:18,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:18,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1489299242, now seen corresponding path program 5 times [2019-12-07 12:02:18,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:18,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787729762] [2019-12-07 12:02:18,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:18,121 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 12:02:18,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787729762] [2019-12-07 12:02:18,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:18,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:18,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504463903] [2019-12-07 12:02:18,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:18,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:18,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:18,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:18,123 INFO L87 Difference]: Start difference. First operand 847 states and 1706 transitions. Second operand 3 states. [2019-12-07 12:02:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:18,132 INFO L93 Difference]: Finished difference Result 847 states and 1704 transitions. [2019-12-07 12:02:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:18,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 12:02:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:18,133 INFO L225 Difference]: With dead ends: 847 [2019-12-07 12:02:18,133 INFO L226 Difference]: Without dead ends: 847 [2019-12-07 12:02:18,134 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 12:02:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-12-07 12:02:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 734. [2019-12-07 12:02:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-12-07 12:02:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1495 transitions. [2019-12-07 12:02:18,142 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1495 transitions. Word has length 41 [2019-12-07 12:02:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:18,142 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1495 transitions. [2019-12-07 12:02:18,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1495 transitions. [2019-12-07 12:02:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:02:18,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:18,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:18,144 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:18,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:18,144 INFO L82 PathProgramCache]: Analyzing trace with hash 58672515, now seen corresponding path program 1 times [2019-12-07 12:02:18,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:18,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014372771] [2019-12-07 12:02:18,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:18,181 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 12:02:18,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014372771] [2019-12-07 12:02:18,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:18,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:18,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999828785] [2019-12-07 12:02:18,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:18,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:18,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:18,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:18,182 INFO L87 Difference]: Start difference. First operand 734 states and 1495 transitions. Second operand 3 states. [2019-12-07 12:02:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:18,191 INFO L93 Difference]: Finished difference Result 1223 states and 2487 transitions. [2019-12-07 12:02:18,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:18,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 12:02:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:18,193 INFO L225 Difference]: With dead ends: 1223 [2019-12-07 12:02:18,193 INFO L226 Difference]: Without dead ends: 507 [2019-12-07 12:02:18,193 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 12:02:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-07 12:02:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-12-07 12:02:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-07 12:02:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1020 transitions. [2019-12-07 12:02:18,201 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1020 transitions. Word has length 42 [2019-12-07 12:02:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:18,201 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1020 transitions. [2019-12-07 12:02:18,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1020 transitions. [2019-12-07 12:02:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:02:18,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:18,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:18,203 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:18,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:18,203 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 2 times [2019-12-07 12:02:18,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:18,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772886558] [2019-12-07 12:02:18,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:02:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:02:18,278 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:02:18,278 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:02:18,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2565~0.base_24| 4) |v_#length_15|) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2565~0.base_24| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2565~0.base_24|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2565~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2565~0.base_24|) |v_ULTIMATE.start_main_~#t2565~0.offset_18| 0))) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_ULTIMATE.start_main_~#t2565~0.offset_18| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2565~0.base_24|)) (= 0 v_~x$r_buff1_thd2~0_124) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_~#t2565~0.base=|v_ULTIMATE.start_main_~#t2565~0.base_24|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, ULTIMATE.start_main_~#t2566~0.offset=|v_ULTIMATE.start_main_~#t2566~0.offset_18|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2565~0.offset=|v_ULTIMATE.start_main_~#t2565~0.offset_18|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t2566~0.base=|v_ULTIMATE.start_main_~#t2566~0.base_25|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2565~0.base, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2566~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2565~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2566~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:02:18,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2566~0.base_11| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2566~0.base_11| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2566~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t2566~0.offset_9|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2566~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2566~0.base_11|)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2566~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2566~0.base_11|) |v_ULTIMATE.start_main_~#t2566~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t2566~0.offset=|v_ULTIMATE.start_main_~#t2566~0.offset_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2566~0.base=|v_ULTIMATE.start_main_~#t2566~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t2566~0.offset, #length, ULTIMATE.start_main_~#t2566~0.base] because there is no mapped edge [2019-12-07 12:02:18,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:02:18,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-359922800 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out-359922800| |P0Thread1of1ForFork1_#t~ite8_Out-359922800|) (= ~x$w_buff0~0_In-359922800 |P0Thread1of1ForFork1_#t~ite8_Out-359922800|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-359922800 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-359922800 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-359922800 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-359922800 256))))) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite9_Out-359922800| ~x$w_buff0~0_In-359922800) (= |P0Thread1of1ForFork1_#t~ite8_In-359922800| |P0Thread1of1ForFork1_#t~ite8_Out-359922800|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-359922800, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-359922800, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-359922800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-359922800, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-359922800, ~weak$$choice2~0=~weak$$choice2~0_In-359922800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-359922800} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-359922800, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-359922800, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-359922800|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-359922800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-359922800, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-359922800, ~weak$$choice2~0=~weak$$choice2~0_In-359922800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-359922800} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 12:02:18,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 12:02:18,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 12:02:18,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1945415887 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1945415887 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1945415887| ~x$w_buff0_used~0_In-1945415887) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1945415887|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1945415887, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1945415887} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1945415887, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1945415887|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1945415887} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 12:02:18,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In883366699 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In883366699 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In883366699 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In883366699 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out883366699| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out883366699| ~x$w_buff1_used~0_In883366699) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In883366699, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In883366699, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In883366699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In883366699} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In883366699, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In883366699, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In883366699, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out883366699|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In883366699} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 12:02:18,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-512097212 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-512097212 256))) (.cse2 (= ~x$r_buff0_thd2~0_In-512097212 ~x$r_buff0_thd2~0_Out-512097212))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-512097212) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-512097212, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-512097212} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-512097212|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-512097212, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-512097212} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:02:18,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1380548797 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1380548797 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1380548797 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1380548797 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1380548797| ~x$r_buff1_thd2~0_In1380548797) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite31_Out1380548797| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1380548797, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1380548797, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1380548797, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1380548797} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1380548797|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1380548797, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1380548797, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1380548797, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1380548797} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 12:02:18,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, 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 12:02:18,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:02:18,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-984864369 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-984864369 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite34_Out-984864369| |ULTIMATE.start_main_#t~ite35_Out-984864369|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-984864369| ~x$w_buff1~0_In-984864369) .cse2) (and (or .cse1 .cse0) .cse2 (= ~x~0_In-984864369 |ULTIMATE.start_main_#t~ite34_Out-984864369|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-984864369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-984864369, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-984864369, ~x~0=~x~0_In-984864369} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-984864369, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-984864369|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-984864369, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-984864369, ~x~0=~x~0_In-984864369, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-984864369|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 12:02:18,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1177472644 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1177472644 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out1177472644| ~x$w_buff0_used~0_In1177472644) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out1177472644| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1177472644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1177472644} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1177472644, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1177472644|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1177472644} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 12:02:18,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1035322595 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1035322595 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1035322595 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1035322595 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1035322595 |ULTIMATE.start_main_#t~ite37_Out1035322595|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1035322595|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1035322595, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1035322595, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1035322595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1035322595} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1035322595, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1035322595, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1035322595|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1035322595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1035322595} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 12:02:18,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1989154213 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1989154213 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1989154213| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1989154213 |ULTIMATE.start_main_#t~ite38_Out1989154213|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1989154213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1989154213} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1989154213, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1989154213|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1989154213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:02:18,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-177650252 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-177650252 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-177650252 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-177650252 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-177650252| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-177650252 |ULTIMATE.start_main_#t~ite39_Out-177650252|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-177650252, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-177650252, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-177650252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-177650252} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-177650252, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-177650252|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-177650252, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-177650252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-177650252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:02:18,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:02:18,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:02:18 BasicIcfg [2019-12-07 12:02:18,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:02:18,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:02:18,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:02:18,341 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:02:18,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:02:10" (3/4) ... [2019-12-07 12:02:18,344 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:02:18,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2565~0.base_24| 4) |v_#length_15|) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2565~0.base_24| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2565~0.base_24|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2565~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2565~0.base_24|) |v_ULTIMATE.start_main_~#t2565~0.offset_18| 0))) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_ULTIMATE.start_main_~#t2565~0.offset_18| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2565~0.base_24|)) (= 0 v_~x$r_buff1_thd2~0_124) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_~#t2565~0.base=|v_ULTIMATE.start_main_~#t2565~0.base_24|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, ULTIMATE.start_main_~#t2566~0.offset=|v_ULTIMATE.start_main_~#t2566~0.offset_18|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2565~0.offset=|v_ULTIMATE.start_main_~#t2565~0.offset_18|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t2566~0.base=|v_ULTIMATE.start_main_~#t2566~0.base_25|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2565~0.base, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2566~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2565~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2566~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:02:18,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2566~0.base_11| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2566~0.base_11| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2566~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t2566~0.offset_9|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2566~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2566~0.base_11|)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2566~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2566~0.base_11|) |v_ULTIMATE.start_main_~#t2566~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t2566~0.offset=|v_ULTIMATE.start_main_~#t2566~0.offset_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2566~0.base=|v_ULTIMATE.start_main_~#t2566~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t2566~0.offset, #length, ULTIMATE.start_main_~#t2566~0.base] because there is no mapped edge [2019-12-07 12:02:18,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:02:18,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-359922800 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out-359922800| |P0Thread1of1ForFork1_#t~ite8_Out-359922800|) (= ~x$w_buff0~0_In-359922800 |P0Thread1of1ForFork1_#t~ite8_Out-359922800|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-359922800 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-359922800 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-359922800 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-359922800 256))))) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite9_Out-359922800| ~x$w_buff0~0_In-359922800) (= |P0Thread1of1ForFork1_#t~ite8_In-359922800| |P0Thread1of1ForFork1_#t~ite8_Out-359922800|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-359922800, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-359922800, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-359922800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-359922800, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-359922800, ~weak$$choice2~0=~weak$$choice2~0_In-359922800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-359922800} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-359922800, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-359922800, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-359922800|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-359922800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-359922800, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-359922800, ~weak$$choice2~0=~weak$$choice2~0_In-359922800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-359922800} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 12:02:18,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 12:02:18,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 12:02:18,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1945415887 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1945415887 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1945415887| ~x$w_buff0_used~0_In-1945415887) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1945415887|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1945415887, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1945415887} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1945415887, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1945415887|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1945415887} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 12:02:18,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In883366699 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In883366699 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In883366699 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In883366699 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out883366699| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out883366699| ~x$w_buff1_used~0_In883366699) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In883366699, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In883366699, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In883366699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In883366699} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In883366699, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In883366699, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In883366699, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out883366699|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In883366699} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 12:02:18,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-512097212 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-512097212 256))) (.cse2 (= ~x$r_buff0_thd2~0_In-512097212 ~x$r_buff0_thd2~0_Out-512097212))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-512097212) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-512097212, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-512097212} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-512097212|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-512097212, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-512097212} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:02:18,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1380548797 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1380548797 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1380548797 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1380548797 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1380548797| ~x$r_buff1_thd2~0_In1380548797) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite31_Out1380548797| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1380548797, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1380548797, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1380548797, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1380548797} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1380548797|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1380548797, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1380548797, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1380548797, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1380548797} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 12:02:18,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, 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 12:02:18,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:02:18,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-984864369 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-984864369 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite34_Out-984864369| |ULTIMATE.start_main_#t~ite35_Out-984864369|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-984864369| ~x$w_buff1~0_In-984864369) .cse2) (and (or .cse1 .cse0) .cse2 (= ~x~0_In-984864369 |ULTIMATE.start_main_#t~ite34_Out-984864369|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-984864369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-984864369, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-984864369, ~x~0=~x~0_In-984864369} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-984864369, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-984864369|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-984864369, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-984864369, ~x~0=~x~0_In-984864369, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-984864369|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 12:02:18,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1177472644 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1177472644 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out1177472644| ~x$w_buff0_used~0_In1177472644) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out1177472644| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1177472644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1177472644} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1177472644, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1177472644|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1177472644} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 12:02:18,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1035322595 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1035322595 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1035322595 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1035322595 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1035322595 |ULTIMATE.start_main_#t~ite37_Out1035322595|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1035322595|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1035322595, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1035322595, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1035322595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1035322595} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1035322595, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1035322595, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1035322595|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1035322595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1035322595} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 12:02:18,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1989154213 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1989154213 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1989154213| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1989154213 |ULTIMATE.start_main_#t~ite38_Out1989154213|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1989154213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1989154213} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1989154213, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1989154213|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1989154213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:02:18,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-177650252 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-177650252 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-177650252 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-177650252 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-177650252| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-177650252 |ULTIMATE.start_main_#t~ite39_Out-177650252|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-177650252, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-177650252, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-177650252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-177650252} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-177650252, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-177650252|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-177650252, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-177650252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-177650252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:02:18,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:02:18,444 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_daea46be-816d-4be6-b853-2fd7034f89fc/bin/uautomizer/witness.graphml [2019-12-07 12:02:18,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:02:18,446 INFO L168 Benchmark]: Toolchain (without parser) took 9065.50 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 447.2 MB). Free memory was 937.2 MB in the beginning and 1.4 GB in the end (delta: -446.1 MB). Peak memory consumption was 590.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:18,446 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:02:18,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -129.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:18,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.96 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 12:02:18,447 INFO L168 Benchmark]: Boogie Preprocessor took 23.76 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 12:02:18,447 INFO L168 Benchmark]: RCFGBuilder took 365.08 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:18,448 INFO L168 Benchmark]: TraceAbstraction took 8164.60 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 343.9 MB). Free memory was 1.0 GB in the beginning and 796.7 MB in the end (delta: 220.3 MB). Peak memory consumption was 564.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:18,448 INFO L168 Benchmark]: Witness Printer took 103.39 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.2 MB). Free memory was 796.7 MB in the beginning and 1.4 GB in the end (delta: -586.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:18,450 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -129.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.96 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 23.76 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 365.08 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8164.60 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 343.9 MB). Free memory was 1.0 GB in the beginning and 796.7 MB in the end (delta: 220.3 MB). Peak memory consumption was 564.2 MB. Max. memory is 11.5 GB. * Witness Printer took 103.39 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.2 MB). Free memory was 796.7 MB in the beginning and 1.4 GB in the end (delta: -586.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2565, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] FCALL, FORK 0 pthread_create(&t2566, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 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) [L767] 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 [!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)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 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)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 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)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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)) [L736] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 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)) [L738] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 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)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 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) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L798] EXPR 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 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 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.0s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2043 SDtfs, 1867 SDslu, 3459 SDs, 0 SdLazy, 2201 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15370occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 11138 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 44278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...