./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/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 70811b208a6daa32cfa256dde138ef46a0780c79 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:50:19,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:50:19,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:50:19,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:50:19,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:50:19,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:50:19,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:50:19,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:50:19,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:50:19,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:50:19,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:50:19,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:50:19,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:50:19,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:50:19,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:50:19,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:50:19,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:50:19,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:50:19,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:50:19,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:50:19,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:50:19,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:50:19,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:50:19,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:50:19,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:50:19,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:50:19,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:50:19,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:50:19,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:50:19,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:50:19,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:50:19,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:50:19,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:50:19,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:50:19,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:50:19,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:50:19,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:50:19,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:50:19,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:50:19,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:50:19,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:50:19,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:50:19,883 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:50:19,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:50:19,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:50:19,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:50:19,884 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:50:19,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:50:19,885 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:50:19,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:50:19,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:50:19,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:50:19,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:50:19,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:50:19,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:50:19,886 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:50:19,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:50:19,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:50:19,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:50:19,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:50:19,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:50:19,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:50:19,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:50:19,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:50:19,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:50:19,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:50:19,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:50:19,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:50:19,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:50:19,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:50:19,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:50:19,888 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_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/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 -> 70811b208a6daa32cfa256dde138ef46a0780c79 [2019-12-07 14:50:19,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:50:19,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:50:19,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:50:19,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:50:19,998 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:50:19,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.i [2019-12-07 14:50:20,038 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/data/f12f5f4d7/d9c40d453e7f429791eb0a85645ea29d/FLAG9d51755cf [2019-12-07 14:50:20,482 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:50:20,482 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.i [2019-12-07 14:50:20,492 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/data/f12f5f4d7/d9c40d453e7f429791eb0a85645ea29d/FLAG9d51755cf [2019-12-07 14:50:20,500 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/data/f12f5f4d7/d9c40d453e7f429791eb0a85645ea29d [2019-12-07 14:50:20,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:50:20,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:50:20,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:50:20,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:50:20,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:50:20,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:20,508 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 02:50:20, skipping insertion in model container [2019-12-07 14:50:20,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:20,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:50:20,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:50:20,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:50:20,832 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:50:20,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:50:20,941 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:50:20,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20 WrapperNode [2019-12-07 14:50:20,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:50:20,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:50:20,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:50:20,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:50:20,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:20,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:20,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:50:20,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:50:20,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:50:20,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:50:21,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:21,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:21,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:21,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:21,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:21,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:21,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... [2019-12-07 14:50:21,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:50:21,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:50:21,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:50:21,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:50:21,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:50:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:50:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:50:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:50:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:50:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:50:21,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:50:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:50:21,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:50:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:50:21,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:50:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:50:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:50:21,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:50:21,071 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:50:21,478 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:50:21,479 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:50:21,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:50:21 BoogieIcfgContainer [2019-12-07 14:50:21,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:50:21,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:50:21,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:50:21,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:50:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:50:20" (1/3) ... [2019-12-07 14:50:21,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@833cb6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:50:21, skipping insertion in model container [2019-12-07 14:50:21,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:50:20" (2/3) ... [2019-12-07 14:50:21,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@833cb6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:50:21, skipping insertion in model container [2019-12-07 14:50:21,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:50:21" (3/3) ... [2019-12-07 14:50:21,484 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_rmo.opt.i [2019-12-07 14:50:21,490 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:50:21,490 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:50:21,495 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:50:21,496 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:50:21,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:50:21,564 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:50:21,576 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:50:21,576 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:50:21,576 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:50:21,576 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:50:21,576 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:50:21,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:50:21,577 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:50:21,577 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:50:21,588 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-07 14:50:21,589 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 14:50:21,650 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 14:50:21,651 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:50:21,664 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 14:50:21,685 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 14:50:21,725 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 14:50:21,725 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:50:21,733 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 14:50:21,756 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 14:50:21,757 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:50:25,223 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 14:50:25,396 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123368 [2019-12-07 14:50:25,396 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 14:50:25,398 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 14:50:27,987 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 14:50:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 14:50:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:50:27,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:27,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:27,993 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash -668359293, now seen corresponding path program 1 times [2019-12-07 14:50:28,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:28,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711628386] [2019-12-07 14:50:28,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:28,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711628386] [2019-12-07 14:50:28,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:28,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:50:28,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671814959] [2019-12-07 14:50:28,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:50:28,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:50:28,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:50:28,220 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 14:50:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:28,602 INFO L93 Difference]: Finished difference Result 41734 states and 171976 transitions. [2019-12-07 14:50:28,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:50:28,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 14:50:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:28,845 INFO L225 Difference]: With dead ends: 41734 [2019-12-07 14:50:28,845 INFO L226 Difference]: Without dead ends: 38878 [2019-12-07 14:50:28,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:50:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38878 states. [2019-12-07 14:50:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38878 to 38878. [2019-12-07 14:50:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38878 states. [2019-12-07 14:50:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38878 states to 38878 states and 160088 transitions. [2019-12-07 14:50:30,286 INFO L78 Accepts]: Start accepts. Automaton has 38878 states and 160088 transitions. Word has length 7 [2019-12-07 14:50:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:30,287 INFO L462 AbstractCegarLoop]: Abstraction has 38878 states and 160088 transitions. [2019-12-07 14:50:30,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:50:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 38878 states and 160088 transitions. [2019-12-07 14:50:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:50:30,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:30,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:30,292 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:30,292 INFO L82 PathProgramCache]: Analyzing trace with hash 298788116, now seen corresponding path program 1 times [2019-12-07 14:50:30,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:30,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764368964] [2019-12-07 14:50:30,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:30,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764368964] [2019-12-07 14:50:30,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:30,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:50:30,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384182378] [2019-12-07 14:50:30,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:50:30,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:30,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:50:30,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:50:30,339 INFO L87 Difference]: Start difference. First operand 38878 states and 160088 transitions. Second operand 3 states. [2019-12-07 14:50:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:30,443 INFO L93 Difference]: Finished difference Result 21899 states and 79018 transitions. [2019-12-07 14:50:30,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:50:30,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 14:50:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:30,570 INFO L225 Difference]: With dead ends: 21899 [2019-12-07 14:50:30,570 INFO L226 Difference]: Without dead ends: 21899 [2019-12-07 14:50:30,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:50:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2019-12-07 14:50:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 21899. [2019-12-07 14:50:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21899 states. [2019-12-07 14:50:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21899 states to 21899 states and 79018 transitions. [2019-12-07 14:50:31,211 INFO L78 Accepts]: Start accepts. Automaton has 21899 states and 79018 transitions. Word has length 13 [2019-12-07 14:50:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:31,211 INFO L462 AbstractCegarLoop]: Abstraction has 21899 states and 79018 transitions. [2019-12-07 14:50:31,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:50:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21899 states and 79018 transitions. [2019-12-07 14:50:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:50:31,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:31,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:31,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:31,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash 521500695, now seen corresponding path program 1 times [2019-12-07 14:50:31,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:31,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156128041] [2019-12-07 14:50:31,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:31,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156128041] [2019-12-07 14:50:31,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:31,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:50:31,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42656831] [2019-12-07 14:50:31,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:50:31,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:31,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:50:31,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:50:31,261 INFO L87 Difference]: Start difference. First operand 21899 states and 79018 transitions. Second operand 4 states. [2019-12-07 14:50:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:31,535 INFO L93 Difference]: Finished difference Result 33427 states and 115552 transitions. [2019-12-07 14:50:31,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:50:31,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:50:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:31,592 INFO L225 Difference]: With dead ends: 33427 [2019-12-07 14:50:31,592 INFO L226 Difference]: Without dead ends: 33411 [2019-12-07 14:50:31,592 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 14:50:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33411 states. [2019-12-07 14:50:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33411 to 32588. [2019-12-07 14:50:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32588 states. [2019-12-07 14:50:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32588 states to 32588 states and 113374 transitions. [2019-12-07 14:50:32,455 INFO L78 Accepts]: Start accepts. Automaton has 32588 states and 113374 transitions. Word has length 14 [2019-12-07 14:50:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:32,455 INFO L462 AbstractCegarLoop]: Abstraction has 32588 states and 113374 transitions. [2019-12-07 14:50:32,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:50:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 32588 states and 113374 transitions. [2019-12-07 14:50:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:50:32,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:32,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:32,458 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:32,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash -46103865, now seen corresponding path program 1 times [2019-12-07 14:50:32,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:32,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597058827] [2019-12-07 14:50:32,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:32,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597058827] [2019-12-07 14:50:32,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:32,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:50:32,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283135001] [2019-12-07 14:50:32,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:50:32,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:32,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:50:32,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:50:32,497 INFO L87 Difference]: Start difference. First operand 32588 states and 113374 transitions. Second operand 4 states. [2019-12-07 14:50:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:32,773 INFO L93 Difference]: Finished difference Result 41783 states and 142906 transitions. [2019-12-07 14:50:32,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:50:32,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 14:50:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:32,842 INFO L225 Difference]: With dead ends: 41783 [2019-12-07 14:50:32,842 INFO L226 Difference]: Without dead ends: 41769 [2019-12-07 14:50:32,842 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 14:50:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41769 states. [2019-12-07 14:50:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41769 to 37544. [2019-12-07 14:50:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37544 states. [2019-12-07 14:50:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37544 states to 37544 states and 129789 transitions. [2019-12-07 14:50:33,768 INFO L78 Accepts]: Start accepts. Automaton has 37544 states and 129789 transitions. Word has length 16 [2019-12-07 14:50:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:33,768 INFO L462 AbstractCegarLoop]: Abstraction has 37544 states and 129789 transitions. [2019-12-07 14:50:33,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:50:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 37544 states and 129789 transitions. [2019-12-07 14:50:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:50:33,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:33,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:33,773 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash 353080702, now seen corresponding path program 1 times [2019-12-07 14:50:33,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:33,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898308680] [2019-12-07 14:50:33,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:33,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898308680] [2019-12-07 14:50:33,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:33,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:50:33,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894180188] [2019-12-07 14:50:33,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:50:33,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:33,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:50:33,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:50:33,837 INFO L87 Difference]: Start difference. First operand 37544 states and 129789 transitions. Second operand 4 states. [2019-12-07 14:50:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:33,966 INFO L93 Difference]: Finished difference Result 37502 states and 129587 transitions. [2019-12-07 14:50:33,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:50:33,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 14:50:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:34,031 INFO L225 Difference]: With dead ends: 37502 [2019-12-07 14:50:34,031 INFO L226 Difference]: Without dead ends: 37502 [2019-12-07 14:50:34,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:50:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37502 states. [2019-12-07 14:50:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37502 to 37458. [2019-12-07 14:50:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-07 14:50:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 129514 transitions. [2019-12-07 14:50:34,914 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 129514 transitions. Word has length 19 [2019-12-07 14:50:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:34,914 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 129514 transitions. [2019-12-07 14:50:34,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:50:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 129514 transitions. [2019-12-07 14:50:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:50:34,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:34,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:34,922 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash -149145903, now seen corresponding path program 1 times [2019-12-07 14:50:34,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:34,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45695481] [2019-12-07 14:50:34,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:34,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45695481] [2019-12-07 14:50:34,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:34,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:50:34,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296530515] [2019-12-07 14:50:34,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:50:34,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:34,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:50:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:50:34,964 INFO L87 Difference]: Start difference. First operand 37458 states and 129514 transitions. Second operand 4 states. [2019-12-07 14:50:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:34,990 INFO L93 Difference]: Finished difference Result 5408 states and 15568 transitions. [2019-12-07 14:50:34,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:50:34,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 14:50:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:34,995 INFO L225 Difference]: With dead ends: 5408 [2019-12-07 14:50:34,995 INFO L226 Difference]: Without dead ends: 5408 [2019-12-07 14:50:34,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:50:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5408 states. [2019-12-07 14:50:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5408 to 5408. [2019-12-07 14:50:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5408 states. [2019-12-07 14:50:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5408 states to 5408 states and 15568 transitions. [2019-12-07 14:50:35,052 INFO L78 Accepts]: Start accepts. Automaton has 5408 states and 15568 transitions. Word has length 20 [2019-12-07 14:50:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:35,052 INFO L462 AbstractCegarLoop]: Abstraction has 5408 states and 15568 transitions. [2019-12-07 14:50:35,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:50:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 5408 states and 15568 transitions. [2019-12-07 14:50:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:50:35,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:35,057 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] [2019-12-07 14:50:35,057 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:35,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1141295517, now seen corresponding path program 1 times [2019-12-07 14:50:35,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:35,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294832291] [2019-12-07 14:50:35,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:35,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294832291] [2019-12-07 14:50:35,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:35,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:50:35,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706980394] [2019-12-07 14:50:35,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:50:35,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:50:35,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:50:35,118 INFO L87 Difference]: Start difference. First operand 5408 states and 15568 transitions. Second operand 5 states. [2019-12-07 14:50:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:35,370 INFO L93 Difference]: Finished difference Result 5908 states and 16580 transitions. [2019-12-07 14:50:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:50:35,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 14:50:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:35,376 INFO L225 Difference]: With dead ends: 5908 [2019-12-07 14:50:35,376 INFO L226 Difference]: Without dead ends: 5907 [2019-12-07 14:50:35,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:50:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5907 states. [2019-12-07 14:50:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5907 to 5652. [2019-12-07 14:50:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2019-12-07 14:50:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 16087 transitions. [2019-12-07 14:50:35,447 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 16087 transitions. Word has length 31 [2019-12-07 14:50:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:35,447 INFO L462 AbstractCegarLoop]: Abstraction has 5652 states and 16087 transitions. [2019-12-07 14:50:35,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:50:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 16087 transitions. [2019-12-07 14:50:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 14:50:35,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:35,453 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] [2019-12-07 14:50:35,453 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1945491634, now seen corresponding path program 1 times [2019-12-07 14:50:35,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:35,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391798029] [2019-12-07 14:50:35,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:35,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391798029] [2019-12-07 14:50:35,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:35,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:50:35,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946236625] [2019-12-07 14:50:35,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:50:35,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:35,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:50:35,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:50:35,515 INFO L87 Difference]: Start difference. First operand 5652 states and 16087 transitions. Second operand 4 states. [2019-12-07 14:50:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:35,547 INFO L93 Difference]: Finished difference Result 5596 states and 15957 transitions. [2019-12-07 14:50:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:50:35,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 14:50:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:35,555 INFO L225 Difference]: With dead ends: 5596 [2019-12-07 14:50:35,555 INFO L226 Difference]: Without dead ends: 5596 [2019-12-07 14:50:35,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:50:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2019-12-07 14:50:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2019-12-07 14:50:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5596 states. [2019-12-07 14:50:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 15957 transitions. [2019-12-07 14:50:35,621 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 15957 transitions. Word has length 36 [2019-12-07 14:50:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:35,621 INFO L462 AbstractCegarLoop]: Abstraction has 5596 states and 15957 transitions. [2019-12-07 14:50:35,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:50:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 15957 transitions. [2019-12-07 14:50:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:50:35,628 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:35,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:35,628 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:35,628 INFO L82 PathProgramCache]: Analyzing trace with hash -360370146, now seen corresponding path program 1 times [2019-12-07 14:50:35,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:35,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131570106] [2019-12-07 14:50:35,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:35,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131570106] [2019-12-07 14:50:35,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:35,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:50:35,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893998508] [2019-12-07 14:50:35,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:50:35,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:35,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:50:35,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:50:35,686 INFO L87 Difference]: Start difference. First operand 5596 states and 15957 transitions. Second operand 5 states. [2019-12-07 14:50:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:35,951 INFO L93 Difference]: Finished difference Result 6580 states and 18403 transitions. [2019-12-07 14:50:35,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:50:35,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-07 14:50:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:35,957 INFO L225 Difference]: With dead ends: 6580 [2019-12-07 14:50:35,957 INFO L226 Difference]: Without dead ends: 6580 [2019-12-07 14:50:35,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:50:35,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2019-12-07 14:50:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6334. [2019-12-07 14:50:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6334 states. [2019-12-07 14:50:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6334 states to 6334 states and 17888 transitions. [2019-12-07 14:50:36,027 INFO L78 Accepts]: Start accepts. Automaton has 6334 states and 17888 transitions. Word has length 45 [2019-12-07 14:50:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:36,027 INFO L462 AbstractCegarLoop]: Abstraction has 6334 states and 17888 transitions. [2019-12-07 14:50:36,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:50:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6334 states and 17888 transitions. [2019-12-07 14:50:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 14:50:36,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:36,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:36,035 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash 181285084, now seen corresponding path program 1 times [2019-12-07 14:50:36,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:36,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960604543] [2019-12-07 14:50:36,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:36,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960604543] [2019-12-07 14:50:36,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:36,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:50:36,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147464895] [2019-12-07 14:50:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:50:36,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:50:36,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:50:36,249 INFO L87 Difference]: Start difference. First operand 6334 states and 17888 transitions. Second operand 9 states. [2019-12-07 14:50:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:37,214 INFO L93 Difference]: Finished difference Result 13638 states and 35065 transitions. [2019-12-07 14:50:37,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:50:37,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-12-07 14:50:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:37,225 INFO L225 Difference]: With dead ends: 13638 [2019-12-07 14:50:37,225 INFO L226 Difference]: Without dead ends: 12956 [2019-12-07 14:50:37,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:50:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12956 states. [2019-12-07 14:50:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12956 to 9025. [2019-12-07 14:50:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9025 states. [2019-12-07 14:50:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9025 states to 9025 states and 24703 transitions. [2019-12-07 14:50:37,344 INFO L78 Accepts]: Start accepts. Automaton has 9025 states and 24703 transitions. Word has length 46 [2019-12-07 14:50:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:37,345 INFO L462 AbstractCegarLoop]: Abstraction has 9025 states and 24703 transitions. [2019-12-07 14:50:37,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:50:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9025 states and 24703 transitions. [2019-12-07 14:50:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 14:50:37,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:37,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:37,356 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1232836532, now seen corresponding path program 2 times [2019-12-07 14:50:37,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:37,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454596420] [2019-12-07 14:50:37,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:37,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454596420] [2019-12-07 14:50:37,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:37,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:50:37,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670946992] [2019-12-07 14:50:37,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:50:37,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:50:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:50:37,571 INFO L87 Difference]: Start difference. First operand 9025 states and 24703 transitions. Second operand 10 states. [2019-12-07 14:50:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:38,349 INFO L93 Difference]: Finished difference Result 14352 states and 36820 transitions. [2019-12-07 14:50:38,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:50:38,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-12-07 14:50:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:38,359 INFO L225 Difference]: With dead ends: 14352 [2019-12-07 14:50:38,359 INFO L226 Difference]: Without dead ends: 11441 [2019-12-07 14:50:38,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:50:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11441 states. [2019-12-07 14:50:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11441 to 9329. [2019-12-07 14:50:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9329 states. [2019-12-07 14:50:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9329 states to 9329 states and 25375 transitions. [2019-12-07 14:50:38,467 INFO L78 Accepts]: Start accepts. Automaton has 9329 states and 25375 transitions. Word has length 46 [2019-12-07 14:50:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:38,467 INFO L462 AbstractCegarLoop]: Abstraction has 9329 states and 25375 transitions. [2019-12-07 14:50:38,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:50:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9329 states and 25375 transitions. [2019-12-07 14:50:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 14:50:38,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:38,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:38,478 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1122320104, now seen corresponding path program 1 times [2019-12-07 14:50:38,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:38,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705194926] [2019-12-07 14:50:38,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:38,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705194926] [2019-12-07 14:50:38,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:38,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:50:38,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713071506] [2019-12-07 14:50:38,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:50:38,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:38,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:50:38,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:50:38,528 INFO L87 Difference]: Start difference. First operand 9329 states and 25375 transitions. Second operand 5 states. [2019-12-07 14:50:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:38,792 INFO L93 Difference]: Finished difference Result 13572 states and 37103 transitions. [2019-12-07 14:50:38,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:50:38,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-07 14:50:38,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:38,805 INFO L225 Difference]: With dead ends: 13572 [2019-12-07 14:50:38,805 INFO L226 Difference]: Without dead ends: 13559 [2019-12-07 14:50:38,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:50:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13559 states. [2019-12-07 14:50:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13559 to 11512. [2019-12-07 14:50:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11512 states. [2019-12-07 14:50:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11512 states to 11512 states and 31370 transitions. [2019-12-07 14:50:38,938 INFO L78 Accepts]: Start accepts. Automaton has 11512 states and 31370 transitions. Word has length 46 [2019-12-07 14:50:38,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:38,939 INFO L462 AbstractCegarLoop]: Abstraction has 11512 states and 31370 transitions. [2019-12-07 14:50:38,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:50:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11512 states and 31370 transitions. [2019-12-07 14:50:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:50:38,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:38,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:38,952 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:38,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1138071248, now seen corresponding path program 1 times [2019-12-07 14:50:38,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:38,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018322173] [2019-12-07 14:50:38,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:38,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018322173] [2019-12-07 14:50:38,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:38,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:50:38,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923706326] [2019-12-07 14:50:38,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:50:38,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:50:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:50:38,994 INFO L87 Difference]: Start difference. First operand 11512 states and 31370 transitions. Second operand 4 states. [2019-12-07 14:50:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:39,038 INFO L93 Difference]: Finished difference Result 19017 states and 49869 transitions. [2019-12-07 14:50:39,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:50:39,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 14:50:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:39,049 INFO L225 Difference]: With dead ends: 19017 [2019-12-07 14:50:39,049 INFO L226 Difference]: Without dead ends: 10788 [2019-12-07 14:50:39,049 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 14:50:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10788 states. [2019-12-07 14:50:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10788 to 10673. [2019-12-07 14:50:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10673 states. [2019-12-07 14:50:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10673 states to 10673 states and 26357 transitions. [2019-12-07 14:50:39,160 INFO L78 Accepts]: Start accepts. Automaton has 10673 states and 26357 transitions. Word has length 47 [2019-12-07 14:50:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:39,160 INFO L462 AbstractCegarLoop]: Abstraction has 10673 states and 26357 transitions. [2019-12-07 14:50:39,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:50:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 10673 states and 26357 transitions. [2019-12-07 14:50:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:50:39,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:39,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:39,173 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:39,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash 115757032, now seen corresponding path program 2 times [2019-12-07 14:50:39,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:39,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085896901] [2019-12-07 14:50:39,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:39,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085896901] [2019-12-07 14:50:39,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:39,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:50:39,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150847983] [2019-12-07 14:50:39,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:50:39,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:39,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:50:39,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:50:39,243 INFO L87 Difference]: Start difference. First operand 10673 states and 26357 transitions. Second operand 5 states. [2019-12-07 14:50:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:39,299 INFO L93 Difference]: Finished difference Result 12012 states and 29455 transitions. [2019-12-07 14:50:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:50:39,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 14:50:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:39,310 INFO L225 Difference]: With dead ends: 12012 [2019-12-07 14:50:39,310 INFO L226 Difference]: Without dead ends: 8827 [2019-12-07 14:50:39,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:50:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8827 states. [2019-12-07 14:50:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8827 to 7400. [2019-12-07 14:50:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7400 states. [2019-12-07 14:50:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7400 states to 7400 states and 18161 transitions. [2019-12-07 14:50:39,407 INFO L78 Accepts]: Start accepts. Automaton has 7400 states and 18161 transitions. Word has length 47 [2019-12-07 14:50:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:39,408 INFO L462 AbstractCegarLoop]: Abstraction has 7400 states and 18161 transitions. [2019-12-07 14:50:39,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:50:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7400 states and 18161 transitions. [2019-12-07 14:50:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:50:39,416 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:39,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:39,416 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash -160832526, now seen corresponding path program 3 times [2019-12-07 14:50:39,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:39,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881374751] [2019-12-07 14:50:39,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:39,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881374751] [2019-12-07 14:50:39,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:39,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:50:39,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061689731] [2019-12-07 14:50:39,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:50:39,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:50:39,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:50:39,473 INFO L87 Difference]: Start difference. First operand 7400 states and 18161 transitions. Second operand 5 states. [2019-12-07 14:50:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:39,506 INFO L93 Difference]: Finished difference Result 5732 states and 14251 transitions. [2019-12-07 14:50:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:50:39,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 14:50:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:39,507 INFO L225 Difference]: With dead ends: 5732 [2019-12-07 14:50:39,507 INFO L226 Difference]: Without dead ends: 780 [2019-12-07 14:50:39,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:50:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2019-12-07 14:50:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 762. [2019-12-07 14:50:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-12-07 14:50:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1649 transitions. [2019-12-07 14:50:39,516 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1649 transitions. Word has length 47 [2019-12-07 14:50:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:39,517 INFO L462 AbstractCegarLoop]: Abstraction has 762 states and 1649 transitions. [2019-12-07 14:50:39,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:50:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1649 transitions. [2019-12-07 14:50:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:50:39,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:39,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:39,518 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:39,518 INFO L82 PathProgramCache]: Analyzing trace with hash 429224045, now seen corresponding path program 1 times [2019-12-07 14:50:39,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:39,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445477613] [2019-12-07 14:50:39,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:39,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445477613] [2019-12-07 14:50:39,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:39,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 14:50:39,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957704383] [2019-12-07 14:50:39,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:50:39,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:39,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:50:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:50:39,668 INFO L87 Difference]: Start difference. First operand 762 states and 1649 transitions. Second operand 13 states. [2019-12-07 14:50:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:41,185 INFO L93 Difference]: Finished difference Result 1479 states and 3239 transitions. [2019-12-07 14:50:41,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 14:50:41,185 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-12-07 14:50:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:41,186 INFO L225 Difference]: With dead ends: 1479 [2019-12-07 14:50:41,186 INFO L226 Difference]: Without dead ends: 1204 [2019-12-07 14:50:41,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2019-12-07 14:50:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-12-07 14:50:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 831. [2019-12-07 14:50:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 14:50:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1816 transitions. [2019-12-07 14:50:41,194 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1816 transitions. Word has length 62 [2019-12-07 14:50:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:41,194 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1816 transitions. [2019-12-07 14:50:41,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:50:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1816 transitions. [2019-12-07 14:50:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:50:41,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:41,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:41,195 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:41,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash 575902287, now seen corresponding path program 2 times [2019-12-07 14:50:41,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:41,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363608977] [2019-12-07 14:50:41,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:50:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:50:41,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363608977] [2019-12-07 14:50:41,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:50:41,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:50:41,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562905468] [2019-12-07 14:50:41,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:50:41,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:50:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:50:41,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:50:41,236 INFO L87 Difference]: Start difference. First operand 831 states and 1816 transitions. Second operand 3 states. [2019-12-07 14:50:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:50:41,243 INFO L93 Difference]: Finished difference Result 831 states and 1815 transitions. [2019-12-07 14:50:41,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:50:41,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 14:50:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:50:41,244 INFO L225 Difference]: With dead ends: 831 [2019-12-07 14:50:41,244 INFO L226 Difference]: Without dead ends: 831 [2019-12-07 14:50:41,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:50:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-12-07 14:50:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 785. [2019-12-07 14:50:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-12-07 14:50:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1737 transitions. [2019-12-07 14:50:41,251 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1737 transitions. Word has length 62 [2019-12-07 14:50:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:50:41,251 INFO L462 AbstractCegarLoop]: Abstraction has 785 states and 1737 transitions. [2019-12-07 14:50:41,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:50:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1737 transitions. [2019-12-07 14:50:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:50:41,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:50:41,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:50:41,252 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:50:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:50:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash 799739627, now seen corresponding path program 1 times [2019-12-07 14:50:41,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:50:41,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272703477] [2019-12-07 14:50:41,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:50:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:50:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:50:41,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:50:41,331 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:50:41,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t80~0.offset_41|) (= v_~y$flush_delayed~0_334 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_211 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t80~0.base_69| 1) |v_#valid_104|) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t80~0.base_69|) (= v_~y$w_buff1_used~0_548 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= v_~__unbuffered_cnt~0_149 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t80~0.base_69|)) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (= v_~y~0_368 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t80~0.base_69| 4) |v_#length_21|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t80~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t80~0.base_69|) |v_ULTIMATE.start_main_~#t80~0.offset_41| 0)) |v_#memory_int_19|) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= 0 v_~y$r_buff1_thd3~0_405) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 v_~__unbuffered_p1_EAX~0_81) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_7|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ULTIMATE.start_main_~#t80~0.offset=|v_ULTIMATE.start_main_~#t80~0.offset_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_~#t82~0.base=|v_ULTIMATE.start_main_~#t82~0.base_43|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ULTIMATE.start_main_~#t81~0.offset=|v_ULTIMATE.start_main_~#t81~0.offset_41|, ULTIMATE.start_main_~#t81~0.base=|v_ULTIMATE.start_main_~#t81~0.base_70|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ~y~0=v_~y~0_368, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t82~0.offset=|v_ULTIMATE.start_main_~#t82~0.offset_14|, ULTIMATE.start_main_~#t80~0.base=|v_ULTIMATE.start_main_~#t80~0.base_69|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t80~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t82~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t81~0.offset, ULTIMATE.start_main_~#t81~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t82~0.offset, ULTIMATE.start_main_~#t80~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:50:41,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t81~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t81~0.base_12| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t81~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t81~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t81~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t81~0.base_12|) |v_ULTIMATE.start_main_~#t81~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t81~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t81~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t81~0.base=|v_ULTIMATE.start_main_~#t81~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t81~0.offset=|v_ULTIMATE.start_main_~#t81~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t81~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t81~0.offset] because there is no mapped edge [2019-12-07 14:50:41,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t82~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t82~0.base_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t82~0.base_11| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t82~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t82~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t82~0.base_11|) |v_ULTIMATE.start_main_~#t82~0.offset_9| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t82~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t82~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t82~0.offset=|v_ULTIMATE.start_main_~#t82~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t82~0.base=|v_ULTIMATE.start_main_~#t82~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t82~0.offset, #length, ULTIMATE.start_main_~#t82~0.base] because there is no mapped edge [2019-12-07 14:50:41,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:50:41,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-560489104 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-560489104 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-560489104| ~y$w_buff0~0_In-560489104)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-560489104| ~y$w_buff1~0_In-560489104)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-560489104, ~y$w_buff1~0=~y$w_buff1~0_In-560489104, ~y$w_buff0~0=~y$w_buff0~0_In-560489104, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-560489104} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-560489104|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-560489104, ~y$w_buff1~0=~y$w_buff1~0_In-560489104, ~y$w_buff0~0=~y$w_buff0~0_In-560489104, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-560489104} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:50:41,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 14:50:41,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 14:50:41,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1907151461 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-1907151461| ~y$mem_tmp~0_In-1907151461)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-1907151461| ~y~0_In-1907151461)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1907151461, ~y$flush_delayed~0=~y$flush_delayed~0_In-1907151461, ~y~0=~y~0_In-1907151461} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1907151461|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1907151461, ~y$flush_delayed~0=~y$flush_delayed~0_In-1907151461, ~y~0=~y~0_In-1907151461} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 14:50:41,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 14:50:41,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-202943053 256)))) (or (and .cse0 (= ~y~0_In-202943053 |P1Thread1of1ForFork2_#t~ite25_Out-202943053|)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out-202943053| ~y$mem_tmp~0_In-202943053) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-202943053, ~y$flush_delayed~0=~y$flush_delayed~0_In-202943053, ~y~0=~y~0_In-202943053} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-202943053, ~y$flush_delayed~0=~y$flush_delayed~0_In-202943053, ~y~0=~y~0_In-202943053, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-202943053|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:50:41,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:50:41,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2058716704 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In2058716704 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2058716704 |P2Thread1of1ForFork0_#t~ite51_Out2058716704|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out2058716704|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2058716704, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2058716704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2058716704, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2058716704, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out2058716704|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 14:50:41,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1369605376 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1369605376 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1369605376 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1369605376 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1369605376|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out1369605376| ~y$w_buff1_used~0_In1369605376)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1369605376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1369605376, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1369605376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1369605376} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1369605376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1369605376, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1369605376, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1369605376|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1369605376} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 14:50:41,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In251188619 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In251188619 ~y$r_buff0_thd3~0_Out251188619)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In251188619 256)))) (or (and (= ~y$r_buff0_thd3~0_Out251188619 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In251188619, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In251188619} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In251188619, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out251188619, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out251188619|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 14:50:41,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In999989949 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In999989949 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In999989949 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In999989949 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In999989949 |P2Thread1of1ForFork0_#t~ite54_Out999989949|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out999989949|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In999989949, ~y$w_buff0_used~0=~y$w_buff0_used~0_In999989949, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In999989949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In999989949} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In999989949, ~y$w_buff0_used~0=~y$w_buff0_used~0_In999989949, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out999989949|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In999989949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In999989949} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 14:50:41,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 14:50:41,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:50:41,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1135351185 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1135351185 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1135351185| |ULTIMATE.start_main_#t~ite58_Out-1135351185|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out-1135351185| ~y~0_In-1135351185) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= ~y$w_buff1~0_In-1135351185 |ULTIMATE.start_main_#t~ite58_Out-1135351185|) (not .cse2) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1135351185, ~y~0=~y~0_In-1135351185, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1135351185, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135351185} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1135351185, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1135351185|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1135351185|, ~y~0=~y~0_In-1135351185, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1135351185, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135351185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:50:41,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1790115856 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1790115856 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out1790115856|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1790115856 |ULTIMATE.start_main_#t~ite60_Out1790115856|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1790115856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1790115856} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1790115856|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1790115856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1790115856} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 14:50:41,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1547805596 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1547805596 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1547805596 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1547805596 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1547805596| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out1547805596| ~y$w_buff1_used~0_In1547805596)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1547805596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547805596, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1547805596, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1547805596} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1547805596|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1547805596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547805596, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1547805596, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1547805596} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:50:41,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In687128340 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In687128340 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In687128340 |ULTIMATE.start_main_#t~ite62_Out687128340|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out687128340| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In687128340, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In687128340} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out687128340|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In687128340, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In687128340} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:50:41,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1955766430 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1955766430 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1955766430 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1955766430 256)))) (or (and (= ~y$r_buff1_thd0~0_In-1955766430 |ULTIMATE.start_main_#t~ite63_Out-1955766430|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-1955766430|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955766430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1955766430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1955766430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955766430} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1955766430|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955766430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1955766430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1955766430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955766430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:50:41,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:50:41,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:50:41 BasicIcfg [2019-12-07 14:50:41,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:50:41,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:50:41,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:50:41,412 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:50:41,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:50:21" (3/4) ... [2019-12-07 14:50:41,414 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:50:41,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t80~0.offset_41|) (= v_~y$flush_delayed~0_334 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_211 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t80~0.base_69| 1) |v_#valid_104|) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t80~0.base_69|) (= v_~y$w_buff1_used~0_548 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= v_~__unbuffered_cnt~0_149 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t80~0.base_69|)) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (= v_~y~0_368 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t80~0.base_69| 4) |v_#length_21|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t80~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t80~0.base_69|) |v_ULTIMATE.start_main_~#t80~0.offset_41| 0)) |v_#memory_int_19|) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= 0 v_~y$r_buff1_thd3~0_405) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 v_~__unbuffered_p1_EAX~0_81) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_7|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ULTIMATE.start_main_~#t80~0.offset=|v_ULTIMATE.start_main_~#t80~0.offset_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_~#t82~0.base=|v_ULTIMATE.start_main_~#t82~0.base_43|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ULTIMATE.start_main_~#t81~0.offset=|v_ULTIMATE.start_main_~#t81~0.offset_41|, ULTIMATE.start_main_~#t81~0.base=|v_ULTIMATE.start_main_~#t81~0.base_70|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ~y~0=v_~y~0_368, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t82~0.offset=|v_ULTIMATE.start_main_~#t82~0.offset_14|, ULTIMATE.start_main_~#t80~0.base=|v_ULTIMATE.start_main_~#t80~0.base_69|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t80~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t82~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t81~0.offset, ULTIMATE.start_main_~#t81~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t82~0.offset, ULTIMATE.start_main_~#t80~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:50:41,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t81~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t81~0.base_12| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t81~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t81~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t81~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t81~0.base_12|) |v_ULTIMATE.start_main_~#t81~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t81~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t81~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t81~0.base=|v_ULTIMATE.start_main_~#t81~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t81~0.offset=|v_ULTIMATE.start_main_~#t81~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t81~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t81~0.offset] because there is no mapped edge [2019-12-07 14:50:41,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t82~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t82~0.base_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t82~0.base_11| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t82~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t82~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t82~0.base_11|) |v_ULTIMATE.start_main_~#t82~0.offset_9| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t82~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t82~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t82~0.offset=|v_ULTIMATE.start_main_~#t82~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t82~0.base=|v_ULTIMATE.start_main_~#t82~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t82~0.offset, #length, ULTIMATE.start_main_~#t82~0.base] because there is no mapped edge [2019-12-07 14:50:41,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:50:41,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-560489104 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-560489104 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-560489104| ~y$w_buff0~0_In-560489104)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-560489104| ~y$w_buff1~0_In-560489104)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-560489104, ~y$w_buff1~0=~y$w_buff1~0_In-560489104, ~y$w_buff0~0=~y$w_buff0~0_In-560489104, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-560489104} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-560489104|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-560489104, ~y$w_buff1~0=~y$w_buff1~0_In-560489104, ~y$w_buff0~0=~y$w_buff0~0_In-560489104, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-560489104} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:50:41,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 14:50:41,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 14:50:41,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1907151461 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-1907151461| ~y$mem_tmp~0_In-1907151461)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-1907151461| ~y~0_In-1907151461)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1907151461, ~y$flush_delayed~0=~y$flush_delayed~0_In-1907151461, ~y~0=~y~0_In-1907151461} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1907151461|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1907151461, ~y$flush_delayed~0=~y$flush_delayed~0_In-1907151461, ~y~0=~y~0_In-1907151461} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 14:50:41,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 14:50:41,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-202943053 256)))) (or (and .cse0 (= ~y~0_In-202943053 |P1Thread1of1ForFork2_#t~ite25_Out-202943053|)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out-202943053| ~y$mem_tmp~0_In-202943053) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-202943053, ~y$flush_delayed~0=~y$flush_delayed~0_In-202943053, ~y~0=~y~0_In-202943053} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-202943053, ~y$flush_delayed~0=~y$flush_delayed~0_In-202943053, ~y~0=~y~0_In-202943053, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-202943053|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:50:41,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:50:41,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2058716704 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In2058716704 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2058716704 |P2Thread1of1ForFork0_#t~ite51_Out2058716704|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out2058716704|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2058716704, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2058716704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2058716704, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2058716704, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out2058716704|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 14:50:41,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1369605376 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1369605376 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1369605376 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1369605376 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1369605376|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out1369605376| ~y$w_buff1_used~0_In1369605376)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1369605376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1369605376, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1369605376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1369605376} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1369605376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1369605376, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1369605376, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1369605376|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1369605376} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 14:50:41,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In251188619 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In251188619 ~y$r_buff0_thd3~0_Out251188619)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In251188619 256)))) (or (and (= ~y$r_buff0_thd3~0_Out251188619 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In251188619, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In251188619} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In251188619, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out251188619, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out251188619|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 14:50:41,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In999989949 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In999989949 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In999989949 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In999989949 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In999989949 |P2Thread1of1ForFork0_#t~ite54_Out999989949|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out999989949|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In999989949, ~y$w_buff0_used~0=~y$w_buff0_used~0_In999989949, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In999989949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In999989949} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In999989949, ~y$w_buff0_used~0=~y$w_buff0_used~0_In999989949, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out999989949|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In999989949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In999989949} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 14:50:41,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 14:50:41,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:50:41,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1135351185 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1135351185 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1135351185| |ULTIMATE.start_main_#t~ite58_Out-1135351185|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out-1135351185| ~y~0_In-1135351185) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= ~y$w_buff1~0_In-1135351185 |ULTIMATE.start_main_#t~ite58_Out-1135351185|) (not .cse2) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1135351185, ~y~0=~y~0_In-1135351185, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1135351185, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135351185} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1135351185, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1135351185|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1135351185|, ~y~0=~y~0_In-1135351185, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1135351185, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135351185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:50:41,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1790115856 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1790115856 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out1790115856|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1790115856 |ULTIMATE.start_main_#t~ite60_Out1790115856|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1790115856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1790115856} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1790115856|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1790115856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1790115856} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 14:50:41,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1547805596 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1547805596 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1547805596 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1547805596 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1547805596| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out1547805596| ~y$w_buff1_used~0_In1547805596)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1547805596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547805596, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1547805596, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1547805596} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1547805596|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1547805596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547805596, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1547805596, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1547805596} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:50:41,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In687128340 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In687128340 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In687128340 |ULTIMATE.start_main_#t~ite62_Out687128340|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out687128340| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In687128340, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In687128340} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out687128340|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In687128340, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In687128340} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:50:41,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1955766430 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1955766430 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1955766430 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1955766430 256)))) (or (and (= ~y$r_buff1_thd0~0_In-1955766430 |ULTIMATE.start_main_#t~ite63_Out-1955766430|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-1955766430|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955766430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1955766430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1955766430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955766430} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1955766430|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955766430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1955766430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1955766430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955766430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:50:41,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:50:41,492 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e2b067aa-5d2d-4246-bcfd-e61c5522cf48/bin/uautomizer/witness.graphml [2019-12-07 14:50:41,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:50:41,493 INFO L168 Benchmark]: Toolchain (without parser) took 20990.00 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 940.8 MB in the beginning and 1.7 GB in the end (delta: -717.3 MB). Peak memory consumption was 566.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:50:41,493 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:50:41,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:50:41,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:50:41,494 INFO L168 Benchmark]: Boogie Preprocessor took 30.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:50:41,494 INFO L168 Benchmark]: RCFGBuilder took 454.05 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: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:50:41,495 INFO L168 Benchmark]: TraceAbstraction took 19931.95 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -683.2 MB). Peak memory consumption was 487.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:50:41,495 INFO L168 Benchmark]: Witness Printer took 79.82 ms. Allocated memory is still 2.3 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:50:41,497 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 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 437.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.49 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. * Boogie Preprocessor took 30.78 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. * RCFGBuilder took 454.05 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: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19931.95 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -683.2 MB). Peak memory consumption was 487.6 MB. Max. memory is 11.5 GB. * Witness Printer took 79.82 ms. Allocated memory is still 2.3 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 196 ProgramPointsBefore, 105 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9301 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 328 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 123368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t80, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t81, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t82, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L790] 3 y$r_buff0_thd3 = (_Bool)1 [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 y$flush_delayed = weak$$choice2 [L796] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L801] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y = y$flush_delayed ? y$mem_tmp : y [L806] 3 y$flush_delayed = (_Bool)0 [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 2 x = 1 [L753] 2 __unbuffered_p1_EAX = x [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3635 SDtfs, 4270 SDslu, 7243 SDs, 0 SdLazy, 4486 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42030occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 15662 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 667 NumberOfCodeBlocks, 667 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 587 ConstructedInterpolants, 0 QuantifiedInterpolants, 176701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...