./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_pso.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_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/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 d4b57650bce60a104c5dd53e95eceb0908722a87 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:52:06,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:52:06,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:52:06,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:52:06,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:52:06,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:52:06,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:52:06,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:52:06,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:52:06,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:52:06,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:52:06,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:52:06,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:52:06,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:52:06,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:52:06,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:52:06,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:52:06,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:52:06,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:52:06,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:52:06,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:52:06,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:52:06,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:52:06,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:52:06,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:52:06,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:52:06,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:52:06,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:52:06,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:52:06,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:52:06,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:52:06,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:52:06,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:52:06,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:52:06,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:52:06,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:52:06,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:52:06,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:52:06,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:52:06,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:52:06,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:52:06,885 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:52:06,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:52:06,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:52:06,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:52:06,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:52:06,896 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:52:06,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:52:06,897 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:52:06,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:52:06,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:52:06,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:52:06,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:52:06,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:52:06,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:52:06,897 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:52:06,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:52:06,898 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:52:06,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:52:06,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:52:06,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:52:06,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:52:06,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:52:06,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:52:06,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:52:06,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:52:06,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:52:06,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:52:06,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:52:06,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:52:06,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:52:06,900 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_dc5dc776-702d-4ff8-9f14-7d024d640e2b/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 -> d4b57650bce60a104c5dd53e95eceb0908722a87 [2019-12-07 10:52:06,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:52:07,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:52:07,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:52:07,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:52:07,010 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:52:07,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt.i [2019-12-07 10:52:07,045 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/data/8d6fe136b/3c48cb6414b3470aac123c58a8d11b70/FLAG6aa274e69 [2019-12-07 10:52:07,489 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:52:07,490 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/sv-benchmarks/c/pthread-wmm/mix016_pso.opt.i [2019-12-07 10:52:07,501 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/data/8d6fe136b/3c48cb6414b3470aac123c58a8d11b70/FLAG6aa274e69 [2019-12-07 10:52:07,510 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/data/8d6fe136b/3c48cb6414b3470aac123c58a8d11b70 [2019-12-07 10:52:07,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:52:07,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:52:07,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:52:07,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:52:07,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:52:07,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,518 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 10:52:07, skipping insertion in model container [2019-12-07 10:52:07,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:52:07,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:52:07,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:52:07,810 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:52:07,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:52:07,901 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:52:07,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07 WrapperNode [2019-12-07 10:52:07,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:52:07,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:52:07,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:52:07,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:52:07,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:52:07,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:52:07,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:52:07,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:52:07,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... [2019-12-07 10:52:07,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:52:07,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:52:07,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:52:07,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:52:07,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:52:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:52:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:52:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:52:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:52:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:52:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:52:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:52:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:52:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:52:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:52:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:52:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:52:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:52:08,023 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:52:08,412 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:52:08,412 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:52:08,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:52:08 BoogieIcfgContainer [2019-12-07 10:52:08,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:52:08,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:52:08,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:52:08,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:52:08,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:52:07" (1/3) ... [2019-12-07 10:52:08,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55020947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:52:08, skipping insertion in model container [2019-12-07 10:52:08,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:07" (2/3) ... [2019-12-07 10:52:08,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55020947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:52:08, skipping insertion in model container [2019-12-07 10:52:08,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:52:08" (3/3) ... [2019-12-07 10:52:08,417 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt.i [2019-12-07 10:52:08,424 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:52:08,424 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:52:08,428 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:52:08,429 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:52:08,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,460 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,460 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,471 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,471 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:52:08,493 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:52:08,505 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:52:08,506 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:52:08,506 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:52:08,506 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:52:08,506 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:52:08,506 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:52:08,506 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:52:08,506 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:52:08,517 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-07 10:52:08,518 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 10:52:08,591 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 10:52:08,592 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:52:08,608 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 904 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:52:08,629 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 10:52:08,674 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 10:52:08,674 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:52:08,683 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 904 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:52:08,706 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 10:52:08,707 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:52:11,988 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 10:52:12,145 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 10:52:12,254 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147047 [2019-12-07 10:52:12,255 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-07 10:52:12,257 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 111 places, 134 transitions [2019-12-07 10:52:15,515 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 48534 states. [2019-12-07 10:52:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 48534 states. [2019-12-07 10:52:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:52:15,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:15,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:15,521 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 10:52:15,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash 746662760, now seen corresponding path program 1 times [2019-12-07 10:52:15,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:15,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689690749] [2019-12-07 10:52:15,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:15,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689690749] [2019-12-07 10:52:15,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:15,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:52:15,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391411445] [2019-12-07 10:52:15,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:52:15,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:15,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:52:15,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:15,703 INFO L87 Difference]: Start difference. First operand 48534 states. Second operand 3 states. [2019-12-07 10:52:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:16,115 INFO L93 Difference]: Finished difference Result 48214 states and 197664 transitions. [2019-12-07 10:52:16,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:52:16,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:52:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:16,383 INFO L225 Difference]: With dead ends: 48214 [2019-12-07 10:52:16,383 INFO L226 Difference]: Without dead ends: 44902 [2019-12-07 10:52:16,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:17,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44902 states. [2019-12-07 10:52:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44902 to 44902. [2019-12-07 10:52:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44902 states. [2019-12-07 10:52:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44902 states to 44902 states and 183960 transitions. [2019-12-07 10:52:18,005 INFO L78 Accepts]: Start accepts. Automaton has 44902 states and 183960 transitions. Word has length 7 [2019-12-07 10:52:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:18,006 INFO L462 AbstractCegarLoop]: Abstraction has 44902 states and 183960 transitions. [2019-12-07 10:52:18,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:52:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 44902 states and 183960 transitions. [2019-12-07 10:52:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:52:18,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:18,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:18,011 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 10:52:18,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:18,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1082779043, now seen corresponding path program 1 times [2019-12-07 10:52:18,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:18,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662756029] [2019-12-07 10:52:18,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:18,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662756029] [2019-12-07 10:52:18,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:18,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:52:18,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134390981] [2019-12-07 10:52:18,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:52:18,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:52:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:18,070 INFO L87 Difference]: Start difference. First operand 44902 states and 183960 transitions. Second operand 4 states. [2019-12-07 10:52:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:18,567 INFO L93 Difference]: Finished difference Result 71574 states and 281396 transitions. [2019-12-07 10:52:18,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:52:18,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:52:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:18,910 INFO L225 Difference]: With dead ends: 71574 [2019-12-07 10:52:18,910 INFO L226 Difference]: Without dead ends: 71542 [2019-12-07 10:52:18,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:52:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71542 states. [2019-12-07 10:52:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71542 to 69774. [2019-12-07 10:52:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69774 states. [2019-12-07 10:52:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69774 states to 69774 states and 275806 transitions. [2019-12-07 10:52:20,852 INFO L78 Accepts]: Start accepts. Automaton has 69774 states and 275806 transitions. Word has length 13 [2019-12-07 10:52:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:20,852 INFO L462 AbstractCegarLoop]: Abstraction has 69774 states and 275806 transitions. [2019-12-07 10:52:20,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:52:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 69774 states and 275806 transitions. [2019-12-07 10:52:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:52:20,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:20,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:20,858 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 10:52:20,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash 837864252, now seen corresponding path program 1 times [2019-12-07 10:52:20,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:20,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136629643] [2019-12-07 10:52:20,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:20,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136629643] [2019-12-07 10:52:20,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:20,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:52:20,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660879414] [2019-12-07 10:52:20,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:52:20,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:52:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:20,914 INFO L87 Difference]: Start difference. First operand 69774 states and 275806 transitions. Second operand 4 states. [2019-12-07 10:52:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:21,416 INFO L93 Difference]: Finished difference Result 88624 states and 345355 transitions. [2019-12-07 10:52:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:52:21,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:52:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:21,595 INFO L225 Difference]: With dead ends: 88624 [2019-12-07 10:52:21,595 INFO L226 Difference]: Without dead ends: 88596 [2019-12-07 10:52:21,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:52:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88596 states. [2019-12-07 10:52:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88596 to 79570. [2019-12-07 10:52:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79570 states. [2019-12-07 10:52:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79570 states to 79570 states and 312836 transitions. [2019-12-07 10:52:24,817 INFO L78 Accepts]: Start accepts. Automaton has 79570 states and 312836 transitions. Word has length 16 [2019-12-07 10:52:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:24,818 INFO L462 AbstractCegarLoop]: Abstraction has 79570 states and 312836 transitions. [2019-12-07 10:52:24,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:52:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 79570 states and 312836 transitions. [2019-12-07 10:52:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:52:24,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:24,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:24,823 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 10:52:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash 204017463, now seen corresponding path program 1 times [2019-12-07 10:52:24,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:24,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719543750] [2019-12-07 10:52:24,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:24,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719543750] [2019-12-07 10:52:24,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:24,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:52:24,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502665991] [2019-12-07 10:52:24,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:52:24,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:24,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:52:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:24,860 INFO L87 Difference]: Start difference. First operand 79570 states and 312836 transitions. Second operand 3 states. [2019-12-07 10:52:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:25,421 INFO L93 Difference]: Finished difference Result 132064 states and 498805 transitions. [2019-12-07 10:52:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:52:25,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 10:52:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:25,717 INFO L225 Difference]: With dead ends: 132064 [2019-12-07 10:52:25,717 INFO L226 Difference]: Without dead ends: 132064 [2019-12-07 10:52:25,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132064 states. [2019-12-07 10:52:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132064 to 117574. [2019-12-07 10:52:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117574 states. [2019-12-07 10:52:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117574 states to 117574 states and 450334 transitions. [2019-12-07 10:52:28,719 INFO L78 Accepts]: Start accepts. Automaton has 117574 states and 450334 transitions. Word has length 17 [2019-12-07 10:52:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:28,720 INFO L462 AbstractCegarLoop]: Abstraction has 117574 states and 450334 transitions. [2019-12-07 10:52:28,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:52:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 117574 states and 450334 transitions. [2019-12-07 10:52:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:52:28,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:28,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:28,727 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 10:52:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash 628271860, now seen corresponding path program 1 times [2019-12-07 10:52:28,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:28,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863972906] [2019-12-07 10:52:28,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:28,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863972906] [2019-12-07 10:52:28,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:28,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:52:28,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364864290] [2019-12-07 10:52:28,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:52:28,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:52:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:28,792 INFO L87 Difference]: Start difference. First operand 117574 states and 450334 transitions. Second operand 3 states. [2019-12-07 10:52:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:29,505 INFO L93 Difference]: Finished difference Result 114554 states and 436668 transitions. [2019-12-07 10:52:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:52:29,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:52:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:29,761 INFO L225 Difference]: With dead ends: 114554 [2019-12-07 10:52:29,761 INFO L226 Difference]: Without dead ends: 114554 [2019-12-07 10:52:29,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114554 states. [2019-12-07 10:52:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114554 to 114481. [2019-12-07 10:52:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114481 states. [2019-12-07 10:52:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114481 states to 114481 states and 436552 transitions. [2019-12-07 10:52:34,243 INFO L78 Accepts]: Start accepts. Automaton has 114481 states and 436552 transitions. Word has length 18 [2019-12-07 10:52:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:34,243 INFO L462 AbstractCegarLoop]: Abstraction has 114481 states and 436552 transitions. [2019-12-07 10:52:34,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:52:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 114481 states and 436552 transitions. [2019-12-07 10:52:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:52:34,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:34,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:34,252 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 10:52:34,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1005580165, now seen corresponding path program 1 times [2019-12-07 10:52:34,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:34,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140262889] [2019-12-07 10:52:34,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:34,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140262889] [2019-12-07 10:52:34,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:34,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:52:34,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701510708] [2019-12-07 10:52:34,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:52:34,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:34,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:52:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:52:34,307 INFO L87 Difference]: Start difference. First operand 114481 states and 436552 transitions. Second operand 5 states. [2019-12-07 10:52:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:34,398 INFO L93 Difference]: Finished difference Result 17025 states and 54977 transitions. [2019-12-07 10:52:34,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:52:34,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 10:52:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:34,410 INFO L225 Difference]: With dead ends: 17025 [2019-12-07 10:52:34,410 INFO L226 Difference]: Without dead ends: 9727 [2019-12-07 10:52:34,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:52:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9727 states. [2019-12-07 10:52:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9727 to 9727. [2019-12-07 10:52:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9727 states. [2019-12-07 10:52:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9727 states to 9727 states and 26868 transitions. [2019-12-07 10:52:34,518 INFO L78 Accepts]: Start accepts. Automaton has 9727 states and 26868 transitions. Word has length 19 [2019-12-07 10:52:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:34,518 INFO L462 AbstractCegarLoop]: Abstraction has 9727 states and 26868 transitions. [2019-12-07 10:52:34,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:52:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9727 states and 26868 transitions. [2019-12-07 10:52:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:52:34,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:34,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:34,519 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 10:52:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:34,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1364222767, now seen corresponding path program 1 times [2019-12-07 10:52:34,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:34,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175433727] [2019-12-07 10:52:34,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:34,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175433727] [2019-12-07 10:52:34,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:34,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:52:34,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803671407] [2019-12-07 10:52:34,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:52:34,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:34,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:52:34,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:34,557 INFO L87 Difference]: Start difference. First operand 9727 states and 26868 transitions. Second operand 4 states. [2019-12-07 10:52:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:34,735 INFO L93 Difference]: Finished difference Result 12116 states and 32850 transitions. [2019-12-07 10:52:34,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:52:34,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 10:52:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:34,747 INFO L225 Difference]: With dead ends: 12116 [2019-12-07 10:52:34,747 INFO L226 Difference]: Without dead ends: 12060 [2019-12-07 10:52:34,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:52:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12060 states. [2019-12-07 10:52:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12060 to 9674. [2019-12-07 10:52:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9674 states. [2019-12-07 10:52:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9674 states to 9674 states and 26687 transitions. [2019-12-07 10:52:34,862 INFO L78 Accepts]: Start accepts. Automaton has 9674 states and 26687 transitions. Word has length 19 [2019-12-07 10:52:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:34,862 INFO L462 AbstractCegarLoop]: Abstraction has 9674 states and 26687 transitions. [2019-12-07 10:52:34,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:52:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 9674 states and 26687 transitions. [2019-12-07 10:52:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:52:34,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:34,868 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 10:52:34,868 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 10:52:34,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:34,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1429692523, now seen corresponding path program 1 times [2019-12-07 10:52:34,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:34,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930910534] [2019-12-07 10:52:34,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:34,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930910534] [2019-12-07 10:52:34,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:34,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:52:34,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342102969] [2019-12-07 10:52:34,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:52:34,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:52:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:52:34,909 INFO L87 Difference]: Start difference. First operand 9674 states and 26687 transitions. Second operand 5 states. [2019-12-07 10:52:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:35,153 INFO L93 Difference]: Finished difference Result 12683 states and 33951 transitions. [2019-12-07 10:52:35,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:52:35,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 10:52:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:35,166 INFO L225 Difference]: With dead ends: 12683 [2019-12-07 10:52:35,166 INFO L226 Difference]: Without dead ends: 12682 [2019-12-07 10:52:35,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:52:35,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12682 states. [2019-12-07 10:52:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12682 to 11863. [2019-12-07 10:52:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11863 states. [2019-12-07 10:52:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11863 states to 11863 states and 32174 transitions. [2019-12-07 10:52:35,296 INFO L78 Accepts]: Start accepts. Automaton has 11863 states and 32174 transitions. Word has length 31 [2019-12-07 10:52:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:35,297 INFO L462 AbstractCegarLoop]: Abstraction has 11863 states and 32174 transitions. [2019-12-07 10:52:35,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:52:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11863 states and 32174 transitions. [2019-12-07 10:52:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:52:35,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:35,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:35,305 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 10:52:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:35,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1846791940, now seen corresponding path program 1 times [2019-12-07 10:52:35,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:35,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300093874] [2019-12-07 10:52:35,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:35,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300093874] [2019-12-07 10:52:35,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:35,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:52:35,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652140336] [2019-12-07 10:52:35,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:52:35,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:52:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:35,329 INFO L87 Difference]: Start difference. First operand 11863 states and 32174 transitions. Second operand 3 states. [2019-12-07 10:52:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:35,397 INFO L93 Difference]: Finished difference Result 12696 states and 32654 transitions. [2019-12-07 10:52:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:52:35,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 10:52:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:35,410 INFO L225 Difference]: With dead ends: 12696 [2019-12-07 10:52:35,410 INFO L226 Difference]: Without dead ends: 12696 [2019-12-07 10:52:35,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12696 states. [2019-12-07 10:52:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12696 to 11939. [2019-12-07 10:52:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11939 states. [2019-12-07 10:52:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11939 states to 11939 states and 30926 transitions. [2019-12-07 10:52:35,547 INFO L78 Accepts]: Start accepts. Automaton has 11939 states and 30926 transitions. Word has length 34 [2019-12-07 10:52:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:35,547 INFO L462 AbstractCegarLoop]: Abstraction has 11939 states and 30926 transitions. [2019-12-07 10:52:35,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:52:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 11939 states and 30926 transitions. [2019-12-07 10:52:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 10:52:35,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:35,562 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 10:52:35,562 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 10:52:35,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:35,563 INFO L82 PathProgramCache]: Analyzing trace with hash -922484020, now seen corresponding path program 1 times [2019-12-07 10:52:35,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:35,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506529227] [2019-12-07 10:52:35,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:35,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506529227] [2019-12-07 10:52:35,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:35,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:52:35,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169241634] [2019-12-07 10:52:35,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:52:35,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:35,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:52:35,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:35,617 INFO L87 Difference]: Start difference. First operand 11939 states and 30926 transitions. Second operand 4 states. [2019-12-07 10:52:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:35,655 INFO L93 Difference]: Finished difference Result 11835 states and 30702 transitions. [2019-12-07 10:52:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:52:35,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 10:52:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:35,666 INFO L225 Difference]: With dead ends: 11835 [2019-12-07 10:52:35,666 INFO L226 Difference]: Without dead ends: 11835 [2019-12-07 10:52:35,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2019-12-07 10:52:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 11835. [2019-12-07 10:52:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11835 states. [2019-12-07 10:52:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11835 states to 11835 states and 30702 transitions. [2019-12-07 10:52:35,784 INFO L78 Accepts]: Start accepts. Automaton has 11835 states and 30702 transitions. Word has length 36 [2019-12-07 10:52:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:35,784 INFO L462 AbstractCegarLoop]: Abstraction has 11835 states and 30702 transitions. [2019-12-07 10:52:35,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:52:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 11835 states and 30702 transitions. [2019-12-07 10:52:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 10:52:35,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:35,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:35,794 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 10:52:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1321912617, now seen corresponding path program 1 times [2019-12-07 10:52:35,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:35,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722318952] [2019-12-07 10:52:35,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:35,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722318952] [2019-12-07 10:52:35,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:35,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:52:35,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937251107] [2019-12-07 10:52:35,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:52:35,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:35,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:52:35,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:52:35,843 INFO L87 Difference]: Start difference. First operand 11835 states and 30702 transitions. Second operand 6 states. [2019-12-07 10:52:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:35,909 INFO L93 Difference]: Finished difference Result 9489 states and 25421 transitions. [2019-12-07 10:52:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:52:35,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-07 10:52:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:35,917 INFO L225 Difference]: With dead ends: 9489 [2019-12-07 10:52:35,918 INFO L226 Difference]: Without dead ends: 9201 [2019-12-07 10:52:35,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:52:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9201 states. [2019-12-07 10:52:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9201 to 7751. [2019-12-07 10:52:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7751 states. [2019-12-07 10:52:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7751 states to 7751 states and 21305 transitions. [2019-12-07 10:52:36,004 INFO L78 Accepts]: Start accepts. Automaton has 7751 states and 21305 transitions. Word has length 37 [2019-12-07 10:52:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:36,004 INFO L462 AbstractCegarLoop]: Abstraction has 7751 states and 21305 transitions. [2019-12-07 10:52:36,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:52:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 7751 states and 21305 transitions. [2019-12-07 10:52:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 10:52:36,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:36,014 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] [2019-12-07 10:52:36,014 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 10:52:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash 96055285, now seen corresponding path program 1 times [2019-12-07 10:52:36,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:36,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275354385] [2019-12-07 10:52:36,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:36,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275354385] [2019-12-07 10:52:36,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:36,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:52:36,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142619297] [2019-12-07 10:52:36,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:52:36,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:36,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:52:36,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:52:36,193 INFO L87 Difference]: Start difference. First operand 7751 states and 21305 transitions. Second operand 13 states. [2019-12-07 10:52:37,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:37,418 INFO L93 Difference]: Finished difference Result 25047 states and 67995 transitions. [2019-12-07 10:52:37,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 10:52:37,419 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-12-07 10:52:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:37,434 INFO L225 Difference]: With dead ends: 25047 [2019-12-07 10:52:37,434 INFO L226 Difference]: Without dead ends: 15329 [2019-12-07 10:52:37,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 10:52:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15329 states. [2019-12-07 10:52:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15329 to 12101. [2019-12-07 10:52:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12101 states. [2019-12-07 10:52:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12101 states to 12101 states and 33432 transitions. [2019-12-07 10:52:37,669 INFO L78 Accepts]: Start accepts. Automaton has 12101 states and 33432 transitions. Word has length 61 [2019-12-07 10:52:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:37,669 INFO L462 AbstractCegarLoop]: Abstraction has 12101 states and 33432 transitions. [2019-12-07 10:52:37,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:52:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 12101 states and 33432 transitions. [2019-12-07 10:52:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 10:52:37,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:37,684 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] [2019-12-07 10:52:37,684 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 10:52:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1611813191, now seen corresponding path program 2 times [2019-12-07 10:52:37,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:37,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756879079] [2019-12-07 10:52:37,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:37,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756879079] [2019-12-07 10:52:37,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:37,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:52:37,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900099913] [2019-12-07 10:52:37,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:52:37,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:52:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:52:37,746 INFO L87 Difference]: Start difference. First operand 12101 states and 33432 transitions. Second operand 5 states. [2019-12-07 10:52:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:37,984 INFO L93 Difference]: Finished difference Result 13386 states and 36554 transitions. [2019-12-07 10:52:37,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:52:37,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-07 10:52:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:37,997 INFO L225 Difference]: With dead ends: 13386 [2019-12-07 10:52:37,998 INFO L226 Difference]: Without dead ends: 13386 [2019-12-07 10:52:37,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:52:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13386 states. [2019-12-07 10:52:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13386 to 12873. [2019-12-07 10:52:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12873 states. [2019-12-07 10:52:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12873 states to 12873 states and 35364 transitions. [2019-12-07 10:52:38,141 INFO L78 Accepts]: Start accepts. Automaton has 12873 states and 35364 transitions. Word has length 61 [2019-12-07 10:52:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:38,141 INFO L462 AbstractCegarLoop]: Abstraction has 12873 states and 35364 transitions. [2019-12-07 10:52:38,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:52:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 12873 states and 35364 transitions. [2019-12-07 10:52:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:52:38,155 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:38,155 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 10:52:38,155 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 10:52:38,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:38,155 INFO L82 PathProgramCache]: Analyzing trace with hash 662776173, now seen corresponding path program 1 times [2019-12-07 10:52:38,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:38,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393669899] [2019-12-07 10:52:38,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:38,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393669899] [2019-12-07 10:52:38,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:38,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:52:38,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692415007] [2019-12-07 10:52:38,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:52:38,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:38,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:52:38,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:52:38,357 INFO L87 Difference]: Start difference. First operand 12873 states and 35364 transitions. Second operand 9 states. [2019-12-07 10:52:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:39,209 INFO L93 Difference]: Finished difference Result 21585 states and 54452 transitions. [2019-12-07 10:52:39,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:52:39,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-07 10:52:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:39,224 INFO L225 Difference]: With dead ends: 21585 [2019-12-07 10:52:39,224 INFO L226 Difference]: Without dead ends: 16984 [2019-12-07 10:52:39,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 10:52:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16984 states. [2019-12-07 10:52:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16984 to 12697. [2019-12-07 10:52:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12697 states. [2019-12-07 10:52:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12697 states to 12697 states and 32969 transitions. [2019-12-07 10:52:39,394 INFO L78 Accepts]: Start accepts. Automaton has 12697 states and 32969 transitions. Word has length 62 [2019-12-07 10:52:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:39,394 INFO L462 AbstractCegarLoop]: Abstraction has 12697 states and 32969 transitions. [2019-12-07 10:52:39,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:52:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 12697 states and 32969 transitions. [2019-12-07 10:52:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:52:39,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:39,405 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 10:52:39,405 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 10:52:39,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash 132521196, now seen corresponding path program 1 times [2019-12-07 10:52:39,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:39,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037796670] [2019-12-07 10:52:39,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:39,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037796670] [2019-12-07 10:52:39,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:39,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:52:39,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886073460] [2019-12-07 10:52:39,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:52:39,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:52:39,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:39,456 INFO L87 Difference]: Start difference. First operand 12697 states and 32969 transitions. Second operand 4 states. [2019-12-07 10:52:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:39,494 INFO L93 Difference]: Finished difference Result 14142 states and 35994 transitions. [2019-12-07 10:52:39,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:52:39,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 10:52:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:39,502 INFO L225 Difference]: With dead ends: 14142 [2019-12-07 10:52:39,502 INFO L226 Difference]: Without dead ends: 7877 [2019-12-07 10:52:39,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:52:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7877 states. [2019-12-07 10:52:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7877 to 7877. [2019-12-07 10:52:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7877 states. [2019-12-07 10:52:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 18920 transitions. [2019-12-07 10:52:39,580 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 18920 transitions. Word has length 62 [2019-12-07 10:52:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:39,580 INFO L462 AbstractCegarLoop]: Abstraction has 7877 states and 18920 transitions. [2019-12-07 10:52:39,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:52:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 18920 transitions. [2019-12-07 10:52:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:52:39,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:39,585 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 10:52:39,585 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 10:52:39,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1644291991, now seen corresponding path program 2 times [2019-12-07 10:52:39,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:39,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315125432] [2019-12-07 10:52:39,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:39,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315125432] [2019-12-07 10:52:39,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:39,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:52:39,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24087424] [2019-12-07 10:52:39,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:52:39,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:39,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:52:39,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:52:39,760 INFO L87 Difference]: Start difference. First operand 7877 states and 18920 transitions. Second operand 9 states. [2019-12-07 10:52:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:41,025 INFO L93 Difference]: Finished difference Result 16331 states and 37796 transitions. [2019-12-07 10:52:41,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:52:41,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-07 10:52:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:41,042 INFO L225 Difference]: With dead ends: 16331 [2019-12-07 10:52:41,042 INFO L226 Difference]: Without dead ends: 11997 [2019-12-07 10:52:41,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:52:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11997 states. [2019-12-07 10:52:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11997 to 7538. [2019-12-07 10:52:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7538 states. [2019-12-07 10:52:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7538 states to 7538 states and 18224 transitions. [2019-12-07 10:52:41,141 INFO L78 Accepts]: Start accepts. Automaton has 7538 states and 18224 transitions. Word has length 62 [2019-12-07 10:52:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:41,141 INFO L462 AbstractCegarLoop]: Abstraction has 7538 states and 18224 transitions. [2019-12-07 10:52:41,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:52:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 7538 states and 18224 transitions. [2019-12-07 10:52:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:52:41,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:41,147 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 10:52:41,147 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 10:52:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1583249588, now seen corresponding path program 2 times [2019-12-07 10:52:41,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:41,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838956670] [2019-12-07 10:52:41,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:41,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838956670] [2019-12-07 10:52:41,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:41,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:52:41,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732231684] [2019-12-07 10:52:41,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:52:41,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:41,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:52:41,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:52:41,278 INFO L87 Difference]: Start difference. First operand 7538 states and 18224 transitions. Second operand 10 states. [2019-12-07 10:52:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:41,779 INFO L93 Difference]: Finished difference Result 9577 states and 22785 transitions. [2019-12-07 10:52:41,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:52:41,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 10:52:41,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:41,780 INFO L225 Difference]: With dead ends: 9577 [2019-12-07 10:52:41,780 INFO L226 Difference]: Without dead ends: 897 [2019-12-07 10:52:41,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:52:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-12-07 10:52:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2019-12-07 10:52:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-12-07 10:52:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1808 transitions. [2019-12-07 10:52:41,787 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1808 transitions. Word has length 62 [2019-12-07 10:52:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:41,787 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1808 transitions. [2019-12-07 10:52:41,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:52:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1808 transitions. [2019-12-07 10:52:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:52:41,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:41,788 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 10:52:41,788 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 10:52:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1007960676, now seen corresponding path program 3 times [2019-12-07 10:52:41,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:41,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992492682] [2019-12-07 10:52:41,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:41,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992492682] [2019-12-07 10:52:41,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:41,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:52:41,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320291780] [2019-12-07 10:52:41,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:52:41,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:52:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:52:41,850 INFO L87 Difference]: Start difference. First operand 897 states and 1808 transitions. Second operand 7 states. [2019-12-07 10:52:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:41,980 INFO L93 Difference]: Finished difference Result 1620 states and 3241 transitions. [2019-12-07 10:52:41,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:52:41,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 10:52:41,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:41,981 INFO L225 Difference]: With dead ends: 1620 [2019-12-07 10:52:41,981 INFO L226 Difference]: Without dead ends: 1172 [2019-12-07 10:52:41,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:52:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-12-07 10:52:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 950. [2019-12-07 10:52:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-07 10:52:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1900 transitions. [2019-12-07 10:52:41,989 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1900 transitions. Word has length 62 [2019-12-07 10:52:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:41,989 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1900 transitions. [2019-12-07 10:52:41,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:52:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1900 transitions. [2019-12-07 10:52:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:52:41,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:41,990 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 10:52:41,990 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:52:41,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1552326044, now seen corresponding path program 4 times [2019-12-07 10:52:41,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:41,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432234740] [2019-12-07 10:52:41,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:42,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432234740] [2019-12-07 10:52:42,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:42,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:52:42,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961604411] [2019-12-07 10:52:42,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:52:42,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:42,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:52:42,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:52:42,061 INFO L87 Difference]: Start difference. First operand 950 states and 1900 transitions. Second operand 8 states. [2019-12-07 10:52:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:42,333 INFO L93 Difference]: Finished difference Result 1514 states and 2926 transitions. [2019-12-07 10:52:42,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:52:42,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-07 10:52:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:42,335 INFO L225 Difference]: With dead ends: 1514 [2019-12-07 10:52:42,335 INFO L226 Difference]: Without dead ends: 1514 [2019-12-07 10:52:42,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:52:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-12-07 10:52:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 988. [2019-12-07 10:52:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-12-07 10:52:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1964 transitions. [2019-12-07 10:52:42,343 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1964 transitions. Word has length 62 [2019-12-07 10:52:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:42,344 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 1964 transitions. [2019-12-07 10:52:42,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:52:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1964 transitions. [2019-12-07 10:52:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:52:42,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:42,344 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 10:52:42,344 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:52:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1744889270, now seen corresponding path program 5 times [2019-12-07 10:52:42,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:42,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446373663] [2019-12-07 10:52:42,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:42,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446373663] [2019-12-07 10:52:42,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:42,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:52:42,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28088582] [2019-12-07 10:52:42,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:52:42,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:42,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:52:42,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:52:42,403 INFO L87 Difference]: Start difference. First operand 988 states and 1964 transitions. Second operand 8 states. [2019-12-07 10:52:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:42,544 INFO L93 Difference]: Finished difference Result 1471 states and 2809 transitions. [2019-12-07 10:52:42,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:52:42,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-07 10:52:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:42,545 INFO L225 Difference]: With dead ends: 1471 [2019-12-07 10:52:42,546 INFO L226 Difference]: Without dead ends: 1301 [2019-12-07 10:52:42,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:52:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2019-12-07 10:52:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 984. [2019-12-07 10:52:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-12-07 10:52:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1956 transitions. [2019-12-07 10:52:42,554 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1956 transitions. Word has length 62 [2019-12-07 10:52:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:42,554 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1956 transitions. [2019-12-07 10:52:42,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:52:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1956 transitions. [2019-12-07 10:52:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:52:42,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:42,555 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 10:52:42,555 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:52:42,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2036190378, now seen corresponding path program 6 times [2019-12-07 10:52:42,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:42,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669281988] [2019-12-07 10:52:42,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:42,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669281988] [2019-12-07 10:52:42,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:42,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:52:42,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76697184] [2019-12-07 10:52:42,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:52:42,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:42,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:52:42,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:52:42,594 INFO L87 Difference]: Start difference. First operand 984 states and 1956 transitions. Second operand 6 states. [2019-12-07 10:52:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:42,826 INFO L93 Difference]: Finished difference Result 1193 states and 2325 transitions. [2019-12-07 10:52:42,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:52:42,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 10:52:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:42,827 INFO L225 Difference]: With dead ends: 1193 [2019-12-07 10:52:42,827 INFO L226 Difference]: Without dead ends: 1193 [2019-12-07 10:52:42,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:52:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-07 10:52:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1014. [2019-12-07 10:52:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-07 10:52:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2011 transitions. [2019-12-07 10:52:42,835 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2011 transitions. Word has length 62 [2019-12-07 10:52:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:42,835 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2011 transitions. [2019-12-07 10:52:42,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:52:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2011 transitions. [2019-12-07 10:52:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:52:42,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:42,836 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 10:52:42,836 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:52:42,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:42,836 INFO L82 PathProgramCache]: Analyzing trace with hash 229898378, now seen corresponding path program 7 times [2019-12-07 10:52:42,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:42,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200637016] [2019-12-07 10:52:42,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:42,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200637016] [2019-12-07 10:52:42,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:42,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:52:42,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436555015] [2019-12-07 10:52:42,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:52:42,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:42,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:52:42,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:42,864 INFO L87 Difference]: Start difference. First operand 1014 states and 2011 transitions. Second operand 3 states. [2019-12-07 10:52:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:42,873 INFO L93 Difference]: Finished difference Result 1014 states and 2010 transitions. [2019-12-07 10:52:42,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:52:42,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 10:52:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:42,874 INFO L225 Difference]: With dead ends: 1014 [2019-12-07 10:52:42,874 INFO L226 Difference]: Without dead ends: 1014 [2019-12-07 10:52:42,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-12-07 10:52:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 870. [2019-12-07 10:52:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-12-07 10:52:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1745 transitions. [2019-12-07 10:52:42,881 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1745 transitions. Word has length 62 [2019-12-07 10:52:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:42,882 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1745 transitions. [2019-12-07 10:52:42,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:52:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1745 transitions. [2019-12-07 10:52:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:52:42,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:42,882 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 10:52:42,883 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:52:42,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1358707696, now seen corresponding path program 1 times [2019-12-07 10:52:42,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:42,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618976977] [2019-12-07 10:52:42,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:52:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:52:42,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:52:42,948 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:52:42,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~weak$$choice2~0_331 0) (= v_~y$mem_tmp~0_262 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t418~0.base_35|) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff1_used~0_559 0) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd0~0_210 0) (= v_~y$read_delayed~0_8 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t418~0.base_35| 4) |v_#length_23|) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$w_buff1~0_273 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t418~0.base_35| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t418~0.base_35|) |v_ULTIMATE.start_main_~#t418~0.offset_24| 0)) |v_#memory_int_19|) (= 0 v_~y$w_buff0~0_396) (= v_~y$flush_delayed~0_331 0) (= v_~y$r_buff1_thd1~0_223 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t418~0.base_35| 1)) (= 0 v_~y$r_buff0_thd2~0_420) (= 0 v_~__unbuffered_p1_EAX~0_45) (= 0 v_~weak$$choice0~0_251) (= v_~y$r_buff1_thd0~0_289 0) (= v_~__unbuffered_cnt~0_185 0) (= v_~y$w_buff0_used~0_892 0) (= v_~y$r_buff0_thd1~0_153 0) (= 0 |v_#NULL.base_6|) (= v_~x~0_52 0) (= 0 |v_ULTIMATE.start_main_~#t418~0.offset_24|) (= v_~main$tmp_guard1~0_36 0) (= v_~y~0_382 0) (= 0 v_~y$r_buff0_thd3~0_625) (= 0 v_~y$r_buff1_thd3~0_388) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~z~0_29 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t418~0.base_35|) 0) (= 0 v_~y$r_buff1_thd2~0_385) (= v_~__unbuffered_p2_EBX~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~__unbuffered_p0_EAX~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_~#t418~0.offset=|v_ULTIMATE.start_main_~#t418~0.offset_24|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_388, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_331, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_39, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_66|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_15|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_72|, ~weak$$choice0~0=v_~weak$$choice0~0_251, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_196|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_420, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_289, ~x~0=v_~x~0_52, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_892, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_223, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_31|, ~y$w_buff0~0=v_~y$w_buff0~0_396, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_625, ~y~0=v_~y~0_382, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_99|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_385, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_210, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t418~0.base=|v_ULTIMATE.start_main_~#t418~0.base_35|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_331, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t418~0.offset, #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_~#t420~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t420~0.offset, 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, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t419~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t419~0.offset, 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_~#t418~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:52:42,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L830-1-->L832: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t419~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t419~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t419~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11|) |v_ULTIMATE.start_main_~#t419~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t419~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t419~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t419~0.offset] because there is no mapped edge [2019-12-07 10:52:42,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-1-->L834: Formula: (and (not (= |v_ULTIMATE.start_main_~#t420~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t420~0.offset_11| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t420~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13|) |v_ULTIMATE.start_main_~#t420~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t420~0.base_13| 4)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_13|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t420~0.base, ULTIMATE.start_main_~#t420~0.offset] because there is no mapped edge [2019-12-07 10:52:42,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_219 v_~y$w_buff1_used~0_122) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_37) (= 1 v_~y$w_buff0~0_91) (= v_~y$w_buff0~0_92 v_~y$w_buff1~0_64) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_122 256) 0)) (not (= (mod v_~y$w_buff0_used~0_218 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_37) (= v_~y$w_buff0_used~0_218 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_219, ~y$w_buff0~0=v_~y$w_buff0~0_92, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_64, ~y$w_buff0~0=v_~y$w_buff0~0_91, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_122} 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 10:52:42,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1919916417 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1919916417 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1919916417| ~y$w_buff0~0_In1919916417)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1919916417| ~y$w_buff1~0_In1919916417) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1919916417, ~y$w_buff1~0=~y$w_buff1~0_In1919916417, ~y$w_buff0~0=~y$w_buff0~0_In1919916417, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1919916417} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1919916417|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1919916417, ~y$w_buff1~0=~y$w_buff1~0_In1919916417, ~y$w_buff0~0=~y$w_buff0~0_In1919916417, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1919916417} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:52:42,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L792-4-->L793: Formula: (= v_~y~0_37 |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_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 10:52:42,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L797-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_101 v_~y$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_47} 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 10:52:42,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-559008984 256)))) (or (and .cse0 (= ~y~0_In-559008984 |P2Thread1of1ForFork0_#t~ite48_Out-559008984|)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-559008984| ~y$mem_tmp~0_In-559008984) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-559008984, ~y$flush_delayed~0=~y$flush_delayed~0_In-559008984, ~y~0=~y~0_In-559008984} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-559008984|, ~y$mem_tmp~0=~y$mem_tmp~0_In-559008984, ~y$flush_delayed~0=~y$flush_delayed~0_In-559008984, ~y~0=~y~0_In-559008984} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:52:42,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_36 v_~__unbuffered_p0_EAX~0_14) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, 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_112, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36, 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 10:52:42,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1411505670 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1411505670| ~y$mem_tmp~0_In1411505670) (not .cse0)) (and .cse0 (= ~y~0_In1411505670 |P1Thread1of1ForFork2_#t~ite25_Out1411505670|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1411505670, ~y$flush_delayed~0=~y$flush_delayed~0_In1411505670, ~y~0=~y~0_In1411505670} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1411505670, ~y$flush_delayed~0=~y$flush_delayed~0_In1411505670, ~y~0=~y~0_In1411505670, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1411505670|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:52:42,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-206249260 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-206249260 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-206249260|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-206249260 |P2Thread1of1ForFork0_#t~ite51_Out-206249260|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-206249260, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-206249260} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-206249260, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-206249260, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-206249260|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 10:52:42,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1236364359 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1236364359 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1236364359 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1236364359 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out-1236364359| ~y$w_buff1_used~0_In-1236364359) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite52_Out-1236364359| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1236364359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1236364359, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1236364359, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1236364359} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1236364359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1236364359, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1236364359, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1236364359|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1236364359} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 10:52:42,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-->L811: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In-36680584 ~y$r_buff0_thd3~0_Out-36680584)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-36680584 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-36680584 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~y$r_buff0_thd3~0_Out-36680584) (not .cse1) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-36680584, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-36680584} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-36680584, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-36680584, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-36680584|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 10:52:42,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1452220740 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1452220740 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1452220740 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1452220740 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1452220740|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd3~0_In-1452220740 |P2Thread1of1ForFork0_#t~ite54_Out-1452220740|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1452220740, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1452220740, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1452220740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1452220740} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1452220740, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1452220740, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1452220740|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1452220740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1452220740} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 10:52:42,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L811-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_213 |v_P2Thread1of1ForFork0_#t~ite54_38|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_213, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, 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 10:52:42,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1)) (= v_~y~0_235 |v_P1Thread1of1ForFork2_#t~ite25_102|) (= v_~y$flush_delayed~0_185 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_102|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_185, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~y~0=v_~y~0_235, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_101|} 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 10:52:42,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L838-->L840-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= 0 (mod v_~y$w_buff0_used~0_302 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:52:42,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L840-2-->L840-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1054094235| |ULTIMATE.start_main_#t~ite58_Out-1054094235|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1054094235 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1054094235 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1054094235 |ULTIMATE.start_main_#t~ite58_Out-1054094235|) (not .cse1) .cse2) (and .cse2 (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite58_Out-1054094235| ~y~0_In-1054094235)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1054094235, ~y~0=~y~0_In-1054094235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1054094235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1054094235} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1054094235, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1054094235|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1054094235|, ~y~0=~y~0_In-1054094235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1054094235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1054094235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:52:42,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2095444573 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2095444573 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2095444573 |ULTIMATE.start_main_#t~ite60_Out-2095444573|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-2095444573|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2095444573} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2095444573|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2095444573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:52:42,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-893402389 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-893402389 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-893402389 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-893402389 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out-893402389| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-893402389| ~y$w_buff1_used~0_In-893402389) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-893402389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-893402389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-893402389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-893402389} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-893402389|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-893402389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-893402389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-893402389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-893402389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:52:42,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1636482081 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1636482081 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1636482081|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1636482081 |ULTIMATE.start_main_#t~ite62_Out1636482081|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1636482081, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1636482081} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1636482081|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1636482081, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1636482081} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:52:42,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1436018800 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1436018800 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1436018800 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1436018800 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1436018800| ~y$r_buff1_thd0~0_In1436018800) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite63_Out1436018800|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1436018800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1436018800, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1436018800, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1436018800} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1436018800|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1436018800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1436018800, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1436018800, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1436018800} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:52:42,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p2_EAX~0_33) (= v_~__unbuffered_p2_EBX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_237 |v_ULTIMATE.start_main_#t~ite63_37|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, 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 10:52:43,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:52:43 BasicIcfg [2019-12-07 10:52:43,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:52:43,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:52:43,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:52:43,031 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:52:43,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:52:08" (3/4) ... [2019-12-07 10:52:43,033 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:52:43,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~weak$$choice2~0_331 0) (= v_~y$mem_tmp~0_262 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t418~0.base_35|) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff1_used~0_559 0) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd0~0_210 0) (= v_~y$read_delayed~0_8 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t418~0.base_35| 4) |v_#length_23|) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$w_buff1~0_273 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t418~0.base_35| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t418~0.base_35|) |v_ULTIMATE.start_main_~#t418~0.offset_24| 0)) |v_#memory_int_19|) (= 0 v_~y$w_buff0~0_396) (= v_~y$flush_delayed~0_331 0) (= v_~y$r_buff1_thd1~0_223 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t418~0.base_35| 1)) (= 0 v_~y$r_buff0_thd2~0_420) (= 0 v_~__unbuffered_p1_EAX~0_45) (= 0 v_~weak$$choice0~0_251) (= v_~y$r_buff1_thd0~0_289 0) (= v_~__unbuffered_cnt~0_185 0) (= v_~y$w_buff0_used~0_892 0) (= v_~y$r_buff0_thd1~0_153 0) (= 0 |v_#NULL.base_6|) (= v_~x~0_52 0) (= 0 |v_ULTIMATE.start_main_~#t418~0.offset_24|) (= v_~main$tmp_guard1~0_36 0) (= v_~y~0_382 0) (= 0 v_~y$r_buff0_thd3~0_625) (= 0 v_~y$r_buff1_thd3~0_388) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~z~0_29 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t418~0.base_35|) 0) (= 0 v_~y$r_buff1_thd2~0_385) (= v_~__unbuffered_p2_EBX~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~__unbuffered_p0_EAX~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_~#t418~0.offset=|v_ULTIMATE.start_main_~#t418~0.offset_24|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_388, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_331, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_39, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_66|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_15|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_72|, ~weak$$choice0~0=v_~weak$$choice0~0_251, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_196|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_420, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_289, ~x~0=v_~x~0_52, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_892, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_223, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_31|, ~y$w_buff0~0=v_~y$w_buff0~0_396, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_625, ~y~0=v_~y~0_382, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_99|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_385, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_210, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t418~0.base=|v_ULTIMATE.start_main_~#t418~0.base_35|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_331, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t418~0.offset, #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_~#t420~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t420~0.offset, 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, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t419~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t419~0.offset, 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_~#t418~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:52:43,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L830-1-->L832: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t419~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t419~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t419~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11|) |v_ULTIMATE.start_main_~#t419~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t419~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t419~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t419~0.offset] because there is no mapped edge [2019-12-07 10:52:43,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-1-->L834: Formula: (and (not (= |v_ULTIMATE.start_main_~#t420~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t420~0.offset_11| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t420~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13|) |v_ULTIMATE.start_main_~#t420~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t420~0.base_13| 4)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_13|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t420~0.base, ULTIMATE.start_main_~#t420~0.offset] because there is no mapped edge [2019-12-07 10:52:43,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_219 v_~y$w_buff1_used~0_122) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_37) (= 1 v_~y$w_buff0~0_91) (= v_~y$w_buff0~0_92 v_~y$w_buff1~0_64) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_122 256) 0)) (not (= (mod v_~y$w_buff0_used~0_218 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_37) (= v_~y$w_buff0_used~0_218 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_219, ~y$w_buff0~0=v_~y$w_buff0~0_92, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_64, ~y$w_buff0~0=v_~y$w_buff0~0_91, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_122} 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 10:52:43,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1919916417 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1919916417 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1919916417| ~y$w_buff0~0_In1919916417)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1919916417| ~y$w_buff1~0_In1919916417) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1919916417, ~y$w_buff1~0=~y$w_buff1~0_In1919916417, ~y$w_buff0~0=~y$w_buff0~0_In1919916417, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1919916417} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1919916417|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1919916417, ~y$w_buff1~0=~y$w_buff1~0_In1919916417, ~y$w_buff0~0=~y$w_buff0~0_In1919916417, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1919916417} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:52:43,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L792-4-->L793: Formula: (= v_~y~0_37 |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_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 10:52:43,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L797-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_101 v_~y$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_47} 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 10:52:43,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-559008984 256)))) (or (and .cse0 (= ~y~0_In-559008984 |P2Thread1of1ForFork0_#t~ite48_Out-559008984|)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-559008984| ~y$mem_tmp~0_In-559008984) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-559008984, ~y$flush_delayed~0=~y$flush_delayed~0_In-559008984, ~y~0=~y~0_In-559008984} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-559008984|, ~y$mem_tmp~0=~y$mem_tmp~0_In-559008984, ~y$flush_delayed~0=~y$flush_delayed~0_In-559008984, ~y~0=~y~0_In-559008984} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:52:43,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_36 v_~__unbuffered_p0_EAX~0_14) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, 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_112, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36, 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 10:52:43,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1411505670 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1411505670| ~y$mem_tmp~0_In1411505670) (not .cse0)) (and .cse0 (= ~y~0_In1411505670 |P1Thread1of1ForFork2_#t~ite25_Out1411505670|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1411505670, ~y$flush_delayed~0=~y$flush_delayed~0_In1411505670, ~y~0=~y~0_In1411505670} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1411505670, ~y$flush_delayed~0=~y$flush_delayed~0_In1411505670, ~y~0=~y~0_In1411505670, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1411505670|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:52:43,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-206249260 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-206249260 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-206249260|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-206249260 |P2Thread1of1ForFork0_#t~ite51_Out-206249260|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-206249260, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-206249260} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-206249260, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-206249260, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-206249260|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 10:52:43,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1236364359 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1236364359 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1236364359 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1236364359 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out-1236364359| ~y$w_buff1_used~0_In-1236364359) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite52_Out-1236364359| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1236364359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1236364359, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1236364359, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1236364359} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1236364359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1236364359, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1236364359, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1236364359|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1236364359} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 10:52:43,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-->L811: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In-36680584 ~y$r_buff0_thd3~0_Out-36680584)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-36680584 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-36680584 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~y$r_buff0_thd3~0_Out-36680584) (not .cse1) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-36680584, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-36680584} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-36680584, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-36680584, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-36680584|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 10:52:43,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1452220740 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1452220740 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1452220740 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1452220740 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1452220740|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd3~0_In-1452220740 |P2Thread1of1ForFork0_#t~ite54_Out-1452220740|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1452220740, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1452220740, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1452220740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1452220740} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1452220740, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1452220740, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1452220740|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1452220740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1452220740} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 10:52:43,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L811-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_213 |v_P2Thread1of1ForFork0_#t~ite54_38|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_213, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, 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 10:52:43,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1)) (= v_~y~0_235 |v_P1Thread1of1ForFork2_#t~ite25_102|) (= v_~y$flush_delayed~0_185 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_102|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_185, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~y~0=v_~y~0_235, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_101|} 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 10:52:43,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L838-->L840-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= 0 (mod v_~y$w_buff0_used~0_302 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:52:43,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L840-2-->L840-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1054094235| |ULTIMATE.start_main_#t~ite58_Out-1054094235|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1054094235 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1054094235 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1054094235 |ULTIMATE.start_main_#t~ite58_Out-1054094235|) (not .cse1) .cse2) (and .cse2 (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite58_Out-1054094235| ~y~0_In-1054094235)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1054094235, ~y~0=~y~0_In-1054094235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1054094235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1054094235} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1054094235, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1054094235|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1054094235|, ~y~0=~y~0_In-1054094235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1054094235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1054094235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:52:43,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2095444573 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2095444573 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2095444573 |ULTIMATE.start_main_#t~ite60_Out-2095444573|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-2095444573|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2095444573} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2095444573|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2095444573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:52:43,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-893402389 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-893402389 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-893402389 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-893402389 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out-893402389| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-893402389| ~y$w_buff1_used~0_In-893402389) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-893402389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-893402389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-893402389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-893402389} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-893402389|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-893402389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-893402389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-893402389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-893402389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:52:43,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1636482081 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1636482081 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1636482081|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1636482081 |ULTIMATE.start_main_#t~ite62_Out1636482081|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1636482081, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1636482081} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1636482081|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1636482081, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1636482081} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:52:43,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1436018800 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1436018800 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1436018800 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1436018800 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1436018800| ~y$r_buff1_thd0~0_In1436018800) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite63_Out1436018800|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1436018800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1436018800, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1436018800, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1436018800} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1436018800|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1436018800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1436018800, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1436018800, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1436018800} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:52:43,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p2_EAX~0_33) (= v_~__unbuffered_p2_EBX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_237 |v_ULTIMATE.start_main_#t~ite63_37|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, 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 10:52:43,109 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dc5dc776-702d-4ff8-9f14-7d024d640e2b/bin/uautomizer/witness.graphml [2019-12-07 10:52:43,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:52:43,110 INFO L168 Benchmark]: Toolchain (without parser) took 35598.12 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.2 GB). Free memory was 935.3 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 10:52:43,111 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:52:43,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -126.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:52:43,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.48 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 10:52:43,111 INFO L168 Benchmark]: Boogie Preprocessor took 27.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:52:43,111 INFO L168 Benchmark]: RCFGBuilder took 441.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.8 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:52:43,112 INFO L168 Benchmark]: TraceAbstraction took 34617.64 ms. Allocated memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: 4.1 GB). Free memory was 993.8 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 10:52:43,112 INFO L168 Benchmark]: Witness Printer took 78.20 ms. Allocated memory is still 5.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:52:43,113 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -126.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.48 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 27.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 441.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.8 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34617.64 ms. Allocated memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: 4.1 GB). Free memory was 993.8 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 78.20 ms. Allocated memory is still 5.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 195 ProgramPointsBefore, 111 ProgramPointsAfterwards, 241 TransitionsBefore, 134 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 27 ChoiceCompositions, 9672 VarBasedMoverChecksPositive, 313 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 317 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 147047 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L832] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L834] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 y$flush_delayed = weak$$choice2 [L791] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L792] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L793] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L793] 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)) [L794] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L794] 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)) [L795] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L795] 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)) [L796] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L796] 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)) [L798] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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$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)) [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=3, 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 = y$flush_delayed ? y$mem_tmp : y [L801] 3 y$flush_delayed = (_Bool)0 [L804] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=3, 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] [L748] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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] [L755] 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=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=2, 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] [L755] 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) [L756] 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=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=2, 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] [L807] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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] [L756] 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)) [L757] 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=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=2, 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] [L757] 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)) [L758] 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=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=2, 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] [L758] 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)) [L759] 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=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=2, 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] [L759] 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)) [L760] 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=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=2, 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] [L760] 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)) [L761] 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=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=2, 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] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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] [L807] 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) [L808] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 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) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 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, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.4s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4796 SDtfs, 7099 SDslu, 11622 SDs, 0 SdLazy, 6395 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117574occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 44644 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 990 NumberOfCodeBlocks, 990 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 905 ConstructedInterpolants, 0 QuantifiedInterpolants, 261919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...