./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/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 293ddaebb5569fa691b86c5975a2b6f404e4654b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:42:06,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:42:06,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:42:06,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:42:06,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:42:06,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:42:06,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:42:06,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:42:06,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:42:06,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:42:06,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:42:06,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:42:06,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:42:06,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:42:06,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:42:06,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:42:06,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:42:06,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:42:06,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:42:06,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:42:06,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:42:06,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:42:06,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:42:06,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:42:06,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:42:06,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:42:06,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:42:06,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:42:06,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:42:06,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:42:06,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:42:06,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:42:06,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:42:06,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:42:06,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:42:06,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:42:06,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:42:06,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:42:06,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:42:06,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:42:06,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:42:06,054 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:42:06,063 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:42:06,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:42:06,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:42:06,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:42:06,064 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:42:06,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:42:06,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:42:06,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:42:06,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:42:06,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:42:06,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:42:06,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:42:06,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:42:06,065 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:42:06,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:42:06,066 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:42:06,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:42:06,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:42:06,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:42:06,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:42:06,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:42:06,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:42:06,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:42:06,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:42:06,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:42:06,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:42:06,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:42:06,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:42:06,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:42:06,067 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_35db8955-a213-4c8f-94a9-922b5d250d0c/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 -> 293ddaebb5569fa691b86c5975a2b6f404e4654b [2019-12-07 10:42:06,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:42:06,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:42:06,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:42:06,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:42:06,178 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:42:06,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe002_pso.oepc.i [2019-12-07 10:42:06,216 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/data/8105209d6/2bd20318af7d4e32b999289aa3f18748/FLAGb78a1bd8c [2019-12-07 10:42:06,609 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:42:06,609 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/sv-benchmarks/c/pthread-wmm/safe002_pso.oepc.i [2019-12-07 10:42:06,619 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/data/8105209d6/2bd20318af7d4e32b999289aa3f18748/FLAGb78a1bd8c [2019-12-07 10:42:06,628 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/data/8105209d6/2bd20318af7d4e32b999289aa3f18748 [2019-12-07 10:42:06,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:42:06,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:42:06,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:42:06,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:42:06,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:42:06,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:42:06" (1/1) ... [2019-12-07 10:42:06,636 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:42:06, skipping insertion in model container [2019-12-07 10:42:06,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:42:06" (1/1) ... [2019-12-07 10:42:06,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:42:06,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:42:06,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:42:06,948 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:42:06,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:42:07,029 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:42:07,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07 WrapperNode [2019-12-07 10:42:07,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:42:07,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:42:07,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:42:07,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:42:07,035 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:42:07" (1/1) ... [2019-12-07 10:42:07,047 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:42:07" (1/1) ... [2019-12-07 10:42:07,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:42:07,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:42:07,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:42:07,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:42:07,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07" (1/1) ... [2019-12-07 10:42:07,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07" (1/1) ... [2019-12-07 10:42:07,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07" (1/1) ... [2019-12-07 10:42:07,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07" (1/1) ... [2019-12-07 10:42:07,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07" (1/1) ... [2019-12-07 10:42:07,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07" (1/1) ... [2019-12-07 10:42:07,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07" (1/1) ... [2019-12-07 10:42:07,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:42:07,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:42:07,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:42:07,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:42:07,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/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:42:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:42:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:42:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:42:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:42:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:42:07,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:42:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:42:07,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:42:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:42:07,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:42:07,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:42:07,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:42:07,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:42:07,133 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:42:07,485 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:42:07,485 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:42:07,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:07 BoogieIcfgContainer [2019-12-07 10:42:07,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:42:07,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:42:07,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:42:07,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:42:07,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:42:06" (1/3) ... [2019-12-07 10:42:07,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f67ff4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:42:07, skipping insertion in model container [2019-12-07 10:42:07,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:07" (2/3) ... [2019-12-07 10:42:07,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f67ff4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:42:07, skipping insertion in model container [2019-12-07 10:42:07,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:07" (3/3) ... [2019-12-07 10:42:07,490 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_pso.oepc.i [2019-12-07 10:42:07,496 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:42:07,497 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:42:07,501 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:42:07,501 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:42:07,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,543 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,543 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,543 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,543 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,544 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,549 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,549 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:07,567 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:42:07,582 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:42:07,582 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:42:07,582 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:42:07,582 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:42:07,582 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:42:07,582 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:42:07,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:42:07,582 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:42:07,593 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 10:42:07,594 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 10:42:07,646 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 10:42:07,646 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:42:07,656 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 716 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 10:42:07,670 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 10:42:07,697 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 10:42:07,697 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:42:07,703 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 716 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 10:42:07,718 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 10:42:07,719 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:42:10,682 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 10:42:10,778 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-07 10:42:10,778 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 10:42:10,780 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-07 10:42:19,255 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-07 10:42:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-07 10:42:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:42:19,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:19,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:42:19,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:19,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:19,265 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-07 10:42:19,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:19,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660103709] [2019-12-07 10:42:19,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:19,422 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:42:19,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660103709] [2019-12-07 10:42:19,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:19,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:42:19,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612861096] [2019-12-07 10:42:19,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:19,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:19,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:19,437 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-07 10:42:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:20,042 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-07 10:42:20,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:20,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:42:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:20,416 INFO L225 Difference]: With dead ends: 79498 [2019-12-07 10:42:20,416 INFO L226 Difference]: Without dead ends: 74626 [2019-12-07 10:42:20,417 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:42:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-07 10:42:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-07 10:42:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-07 10:42:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-07 10:42:24,396 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-07 10:42:24,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:24,396 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-07 10:42:24,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-07 10:42:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:42:24,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:24,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:24,403 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:24,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-07 10:42:24,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:24,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345397807] [2019-12-07 10:42:24,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:24,477 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:42:24,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345397807] [2019-12-07 10:42:24,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:24,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:24,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844877681] [2019-12-07 10:42:24,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:24,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:24,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:24,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:24,479 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 4 states. [2019-12-07 10:42:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:26,651 INFO L93 Difference]: Finished difference Result 117820 states and 486726 transitions. [2019-12-07 10:42:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:42:26,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:42:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:26,940 INFO L225 Difference]: With dead ends: 117820 [2019-12-07 10:42:26,940 INFO L226 Difference]: Without dead ends: 117722 [2019-12-07 10:42:26,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117722 states. [2019-12-07 10:42:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117722 to 109522. [2019-12-07 10:42:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109522 states. [2019-12-07 10:42:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109522 states to 109522 states and 456872 transitions. [2019-12-07 10:42:31,846 INFO L78 Accepts]: Start accepts. Automaton has 109522 states and 456872 transitions. Word has length 13 [2019-12-07 10:42:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:31,847 INFO L462 AbstractCegarLoop]: Abstraction has 109522 states and 456872 transitions. [2019-12-07 10:42:31,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 109522 states and 456872 transitions. [2019-12-07 10:42:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:42:31,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:31,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:31,850 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:31,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:31,850 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-07 10:42:31,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:31,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803061170] [2019-12-07 10:42:31,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:31,917 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:42:31,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803061170] [2019-12-07 10:42:31,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:31,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:31,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160263449] [2019-12-07 10:42:31,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:31,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:31,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:31,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:31,918 INFO L87 Difference]: Start difference. First operand 109522 states and 456872 transitions. Second operand 4 states. [2019-12-07 10:42:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:32,619 INFO L93 Difference]: Finished difference Result 152034 states and 620571 transitions. [2019-12-07 10:42:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:42:32,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:42:32,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:33,329 INFO L225 Difference]: With dead ends: 152034 [2019-12-07 10:42:33,329 INFO L226 Difference]: Without dead ends: 151922 [2019-12-07 10:42:33,329 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:42:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151922 states. [2019-12-07 10:42:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151922 to 129560. [2019-12-07 10:42:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129560 states. [2019-12-07 10:42:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129560 states to 129560 states and 537418 transitions. [2019-12-07 10:42:40,686 INFO L78 Accepts]: Start accepts. Automaton has 129560 states and 537418 transitions. Word has length 13 [2019-12-07 10:42:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:40,687 INFO L462 AbstractCegarLoop]: Abstraction has 129560 states and 537418 transitions. [2019-12-07 10:42:40,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 129560 states and 537418 transitions. [2019-12-07 10:42:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:42:40,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:40,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:40,690 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:40,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-07 10:42:40,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:40,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189352036] [2019-12-07 10:42:40,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:40,740 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:42:40,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189352036] [2019-12-07 10:42:40,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:40,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:42:40,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514629486] [2019-12-07 10:42:40,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:40,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:40,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:40,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:40,742 INFO L87 Difference]: Start difference. First operand 129560 states and 537418 transitions. Second operand 5 states. [2019-12-07 10:42:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:41,563 INFO L93 Difference]: Finished difference Result 178330 states and 725732 transitions. [2019-12-07 10:42:41,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:42:41,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:42:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:41,988 INFO L225 Difference]: With dead ends: 178330 [2019-12-07 10:42:41,988 INFO L226 Difference]: Without dead ends: 178178 [2019-12-07 10:42:41,988 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:42:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178178 states. [2019-12-07 10:42:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178178 to 143729. [2019-12-07 10:42:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143729 states. [2019-12-07 10:42:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143729 states to 143729 states and 594780 transitions. [2019-12-07 10:42:48,586 INFO L78 Accepts]: Start accepts. Automaton has 143729 states and 594780 transitions. Word has length 14 [2019-12-07 10:42:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:48,586 INFO L462 AbstractCegarLoop]: Abstraction has 143729 states and 594780 transitions. [2019-12-07 10:42:48,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 143729 states and 594780 transitions. [2019-12-07 10:42:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:42:48,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:48,601 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:42:48,601 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash 4499732, now seen corresponding path program 1 times [2019-12-07 10:42:48,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:48,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931694895] [2019-12-07 10:42:48,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:48,649 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:42:48,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931694895] [2019-12-07 10:42:48,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:48,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:48,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684035707] [2019-12-07 10:42:48,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:48,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:48,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:48,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:48,651 INFO L87 Difference]: Start difference. First operand 143729 states and 594780 transitions. Second operand 3 states. [2019-12-07 10:42:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:49,200 INFO L93 Difference]: Finished difference Result 143729 states and 589184 transitions. [2019-12-07 10:42:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:49,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:42:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:51,246 INFO L225 Difference]: With dead ends: 143729 [2019-12-07 10:42:51,246 INFO L226 Difference]: Without dead ends: 143729 [2019-12-07 10:42:51,246 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:42:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143729 states. [2019-12-07 10:42:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143729 to 141749. [2019-12-07 10:42:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141749 states. [2019-12-07 10:42:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141749 states to 141749 states and 581642 transitions. [2019-12-07 10:42:56,795 INFO L78 Accepts]: Start accepts. Automaton has 141749 states and 581642 transitions. Word has length 18 [2019-12-07 10:42:56,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:56,795 INFO L462 AbstractCegarLoop]: Abstraction has 141749 states and 581642 transitions. [2019-12-07 10:42:56,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 141749 states and 581642 transitions. [2019-12-07 10:42:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:42:56,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:56,805 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:42:56,805 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:56,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash -379748476, now seen corresponding path program 1 times [2019-12-07 10:42:56,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:56,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002645387] [2019-12-07 10:42:56,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:56,849 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:42:56,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002645387] [2019-12-07 10:42:56,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:56,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:42:56,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091588543] [2019-12-07 10:42:56,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:56,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:56,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:56,850 INFO L87 Difference]: Start difference. First operand 141749 states and 581642 transitions. Second operand 3 states. [2019-12-07 10:42:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:57,799 INFO L93 Difference]: Finished difference Result 255331 states and 1040114 transitions. [2019-12-07 10:42:57,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:57,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:42:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:58,850 INFO L225 Difference]: With dead ends: 255331 [2019-12-07 10:42:58,850 INFO L226 Difference]: Without dead ends: 247243 [2019-12-07 10:42:58,851 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:43:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247243 states. [2019-12-07 10:43:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247243 to 237827. [2019-12-07 10:43:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237827 states. [2019-12-07 10:43:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237827 states to 237827 states and 977395 transitions. [2019-12-07 10:43:07,869 INFO L78 Accepts]: Start accepts. Automaton has 237827 states and 977395 transitions. Word has length 18 [2019-12-07 10:43:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:07,869 INFO L462 AbstractCegarLoop]: Abstraction has 237827 states and 977395 transitions. [2019-12-07 10:43:07,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:43:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 237827 states and 977395 transitions. [2019-12-07 10:43:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:43:07,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:07,889 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:43:07,890 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:07,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:07,890 INFO L82 PathProgramCache]: Analyzing trace with hash 460505860, now seen corresponding path program 1 times [2019-12-07 10:43:07,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:07,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910921473] [2019-12-07 10:43:07,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:07,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910921473] [2019-12-07 10:43:07,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:07,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:43:07,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998331794] [2019-12-07 10:43:07,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:43:07,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:07,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:43:07,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:43:07,920 INFO L87 Difference]: Start difference. First operand 237827 states and 977395 transitions. Second operand 3 states. [2019-12-07 10:43:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:08,059 INFO L93 Difference]: Finished difference Result 48115 states and 159106 transitions. [2019-12-07 10:43:08,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:43:08,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 10:43:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:08,130 INFO L225 Difference]: With dead ends: 48115 [2019-12-07 10:43:08,130 INFO L226 Difference]: Without dead ends: 48115 [2019-12-07 10:43:08,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:43:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48115 states. [2019-12-07 10:43:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48115 to 48115. [2019-12-07 10:43:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48115 states. [2019-12-07 10:43:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48115 states to 48115 states and 159106 transitions. [2019-12-07 10:43:08,848 INFO L78 Accepts]: Start accepts. Automaton has 48115 states and 159106 transitions. Word has length 19 [2019-12-07 10:43:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:08,848 INFO L462 AbstractCegarLoop]: Abstraction has 48115 states and 159106 transitions. [2019-12-07 10:43:08,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:43:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 48115 states and 159106 transitions. [2019-12-07 10:43:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:43:08,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:08,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:08,857 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:08,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-07 10:43:08,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:08,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312350681] [2019-12-07 10:43:08,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:08,927 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:43:08,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312350681] [2019-12-07 10:43:08,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:08,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:43:08,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118214670] [2019-12-07 10:43:08,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:43:08,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:08,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:43:08,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:43:08,929 INFO L87 Difference]: Start difference. First operand 48115 states and 159106 transitions. Second operand 6 states. [2019-12-07 10:43:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:09,470 INFO L93 Difference]: Finished difference Result 76646 states and 246859 transitions. [2019-12-07 10:43:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:43:09,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:43:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:09,579 INFO L225 Difference]: With dead ends: 76646 [2019-12-07 10:43:09,579 INFO L226 Difference]: Without dead ends: 76616 [2019-12-07 10:43:09,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:43:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76616 states. [2019-12-07 10:43:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76616 to 54563. [2019-12-07 10:43:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54563 states. [2019-12-07 10:43:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54563 states to 54563 states and 178446 transitions. [2019-12-07 10:43:11,551 INFO L78 Accepts]: Start accepts. Automaton has 54563 states and 178446 transitions. Word has length 22 [2019-12-07 10:43:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:11,552 INFO L462 AbstractCegarLoop]: Abstraction has 54563 states and 178446 transitions. [2019-12-07 10:43:11,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:43:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 54563 states and 178446 transitions. [2019-12-07 10:43:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:43:11,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:11,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:11,561 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:11,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-07 10:43:11,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:11,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513203743] [2019-12-07 10:43:11,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:11,636 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:43:11,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513203743] [2019-12-07 10:43:11,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:11,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:43:11,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832190650] [2019-12-07 10:43:11,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:43:11,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:11,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:43:11,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:43:11,637 INFO L87 Difference]: Start difference. First operand 54563 states and 178446 transitions. Second operand 7 states. [2019-12-07 10:43:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:12,291 INFO L93 Difference]: Finished difference Result 80474 states and 258323 transitions. [2019-12-07 10:43:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:43:12,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 10:43:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:12,406 INFO L225 Difference]: With dead ends: 80474 [2019-12-07 10:43:12,406 INFO L226 Difference]: Without dead ends: 80432 [2019-12-07 10:43:12,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:43:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80432 states. [2019-12-07 10:43:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80432 to 49884. [2019-12-07 10:43:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49884 states. [2019-12-07 10:43:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49884 states to 49884 states and 163799 transitions. [2019-12-07 10:43:13,404 INFO L78 Accepts]: Start accepts. Automaton has 49884 states and 163799 transitions. Word has length 22 [2019-12-07 10:43:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:13,404 INFO L462 AbstractCegarLoop]: Abstraction has 49884 states and 163799 transitions. [2019-12-07 10:43:13,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:43:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 49884 states and 163799 transitions. [2019-12-07 10:43:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:43:13,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:13,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:13,419 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:13,419 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-07 10:43:13,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:13,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791977636] [2019-12-07 10:43:13,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:13,449 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:43:13,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791977636] [2019-12-07 10:43:13,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:13,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:43:13,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128615833] [2019-12-07 10:43:13,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:43:13,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:13,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:43:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:43:13,451 INFO L87 Difference]: Start difference. First operand 49884 states and 163799 transitions. Second operand 4 states. [2019-12-07 10:43:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:13,508 INFO L93 Difference]: Finished difference Result 19542 states and 61236 transitions. [2019-12-07 10:43:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:43:13,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 10:43:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:13,530 INFO L225 Difference]: With dead ends: 19542 [2019-12-07 10:43:13,530 INFO L226 Difference]: Without dead ends: 19542 [2019-12-07 10:43:13,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:43:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19542 states. [2019-12-07 10:43:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19542 to 18730. [2019-12-07 10:43:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18730 states. [2019-12-07 10:43:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18730 states to 18730 states and 58490 transitions. [2019-12-07 10:43:13,903 INFO L78 Accepts]: Start accepts. Automaton has 18730 states and 58490 transitions. Word has length 25 [2019-12-07 10:43:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:13,903 INFO L462 AbstractCegarLoop]: Abstraction has 18730 states and 58490 transitions. [2019-12-07 10:43:13,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:43:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18730 states and 58490 transitions. [2019-12-07 10:43:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:43:13,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:13,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:13,926 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:13,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-07 10:43:13,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:13,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255752234] [2019-12-07 10:43:13,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:13,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255752234] [2019-12-07 10:43:13,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:13,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:43:13,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145616873] [2019-12-07 10:43:13,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:43:13,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:13,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:43:13,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:43:13,971 INFO L87 Difference]: Start difference. First operand 18730 states and 58490 transitions. Second operand 5 states. [2019-12-07 10:43:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:14,027 INFO L93 Difference]: Finished difference Result 17072 states and 54472 transitions. [2019-12-07 10:43:14,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:43:14,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 10:43:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:14,047 INFO L225 Difference]: With dead ends: 17072 [2019-12-07 10:43:14,047 INFO L226 Difference]: Without dead ends: 16968 [2019-12-07 10:43:14,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:43:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16968 states. [2019-12-07 10:43:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16968 to 10085. [2019-12-07 10:43:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10085 states. [2019-12-07 10:43:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10085 states to 10085 states and 32067 transitions. [2019-12-07 10:43:14,238 INFO L78 Accepts]: Start accepts. Automaton has 10085 states and 32067 transitions. Word has length 40 [2019-12-07 10:43:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:14,238 INFO L462 AbstractCegarLoop]: Abstraction has 10085 states and 32067 transitions. [2019-12-07 10:43:14,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:43:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 10085 states and 32067 transitions. [2019-12-07 10:43:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 10:43:14,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:14,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:14,248 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1868837699, now seen corresponding path program 1 times [2019-12-07 10:43:14,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:14,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180328022] [2019-12-07 10:43:14,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:14,292 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:43:14,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180328022] [2019-12-07 10:43:14,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:14,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:43:14,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419321813] [2019-12-07 10:43:14,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:43:14,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:14,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:43:14,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:43:14,293 INFO L87 Difference]: Start difference. First operand 10085 states and 32067 transitions. Second operand 3 states. [2019-12-07 10:43:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:14,352 INFO L93 Difference]: Finished difference Result 13367 states and 42707 transitions. [2019-12-07 10:43:14,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:43:14,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 10:43:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:14,369 INFO L225 Difference]: With dead ends: 13367 [2019-12-07 10:43:14,369 INFO L226 Difference]: Without dead ends: 13367 [2019-12-07 10:43:14,369 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:43:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13367 states. [2019-12-07 10:43:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13367 to 11481. [2019-12-07 10:43:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11481 states. [2019-12-07 10:43:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11481 states to 11481 states and 37029 transitions. [2019-12-07 10:43:14,546 INFO L78 Accepts]: Start accepts. Automaton has 11481 states and 37029 transitions. Word has length 55 [2019-12-07 10:43:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:14,547 INFO L462 AbstractCegarLoop]: Abstraction has 11481 states and 37029 transitions. [2019-12-07 10:43:14,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:43:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 11481 states and 37029 transitions. [2019-12-07 10:43:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 10:43:14,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:14,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:14,557 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:14,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:14,557 INFO L82 PathProgramCache]: Analyzing trace with hash -80323290, now seen corresponding path program 1 times [2019-12-07 10:43:14,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:14,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462588352] [2019-12-07 10:43:14,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:14,606 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:43:14,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462588352] [2019-12-07 10:43:14,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:14,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:43:14,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339740021] [2019-12-07 10:43:14,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:43:14,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:14,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:43:14,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:43:14,608 INFO L87 Difference]: Start difference. First operand 11481 states and 37029 transitions. Second operand 5 states. [2019-12-07 10:43:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:14,880 INFO L93 Difference]: Finished difference Result 17800 states and 56309 transitions. [2019-12-07 10:43:14,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:43:14,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 10:43:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:14,901 INFO L225 Difference]: With dead ends: 17800 [2019-12-07 10:43:14,901 INFO L226 Difference]: Without dead ends: 17800 [2019-12-07 10:43:14,902 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:43:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17800 states. [2019-12-07 10:43:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17800 to 15703. [2019-12-07 10:43:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15703 states. [2019-12-07 10:43:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15703 states to 15703 states and 50163 transitions. [2019-12-07 10:43:15,140 INFO L78 Accepts]: Start accepts. Automaton has 15703 states and 50163 transitions. Word has length 55 [2019-12-07 10:43:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:15,140 INFO L462 AbstractCegarLoop]: Abstraction has 15703 states and 50163 transitions. [2019-12-07 10:43:15,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:43:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 15703 states and 50163 transitions. [2019-12-07 10:43:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 10:43:15,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:15,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:15,154 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1723541034, now seen corresponding path program 2 times [2019-12-07 10:43:15,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:15,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097715462] [2019-12-07 10:43:15,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:15,225 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:43:15,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097715462] [2019-12-07 10:43:15,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:15,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:43:15,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194940529] [2019-12-07 10:43:15,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:43:15,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:43:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:43:15,227 INFO L87 Difference]: Start difference. First operand 15703 states and 50163 transitions. Second operand 7 states. [2019-12-07 10:43:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:15,755 INFO L93 Difference]: Finished difference Result 22807 states and 70488 transitions. [2019-12-07 10:43:15,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:43:15,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-07 10:43:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:15,779 INFO L225 Difference]: With dead ends: 22807 [2019-12-07 10:43:15,780 INFO L226 Difference]: Without dead ends: 22807 [2019-12-07 10:43:15,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:43:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22807 states. [2019-12-07 10:43:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22807 to 16980. [2019-12-07 10:43:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16980 states. [2019-12-07 10:43:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16980 states to 16980 states and 53743 transitions. [2019-12-07 10:43:16,054 INFO L78 Accepts]: Start accepts. Automaton has 16980 states and 53743 transitions. Word has length 55 [2019-12-07 10:43:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:16,054 INFO L462 AbstractCegarLoop]: Abstraction has 16980 states and 53743 transitions. [2019-12-07 10:43:16,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:43:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 16980 states and 53743 transitions. [2019-12-07 10:43:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 10:43:16,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:16,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:16,071 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:16,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:16,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1235005634, now seen corresponding path program 3 times [2019-12-07 10:43:16,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:16,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957404586] [2019-12-07 10:43:16,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:16,116 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:43:16,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957404586] [2019-12-07 10:43:16,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:16,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:43:16,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210772848] [2019-12-07 10:43:16,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:43:16,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:16,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:43:16,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:43:16,117 INFO L87 Difference]: Start difference. First operand 16980 states and 53743 transitions. Second operand 3 states. [2019-12-07 10:43:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:16,164 INFO L93 Difference]: Finished difference Result 16115 states and 50404 transitions. [2019-12-07 10:43:16,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:43:16,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 10:43:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:16,183 INFO L225 Difference]: With dead ends: 16115 [2019-12-07 10:43:16,183 INFO L226 Difference]: Without dead ends: 16115 [2019-12-07 10:43:16,183 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:43:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16115 states. [2019-12-07 10:43:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16115 to 15703. [2019-12-07 10:43:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15703 states. [2019-12-07 10:43:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15703 states to 15703 states and 49208 transitions. [2019-12-07 10:43:16,392 INFO L78 Accepts]: Start accepts. Automaton has 15703 states and 49208 transitions. Word has length 55 [2019-12-07 10:43:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:16,392 INFO L462 AbstractCegarLoop]: Abstraction has 15703 states and 49208 transitions. [2019-12-07 10:43:16,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:43:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15703 states and 49208 transitions. [2019-12-07 10:43:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:16,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:16,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:16,407 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:16,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1826980617, now seen corresponding path program 1 times [2019-12-07 10:43:16,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:16,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581096565] [2019-12-07 10:43:16,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:16,464 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:43:16,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581096565] [2019-12-07 10:43:16,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:16,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:43:16,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876984513] [2019-12-07 10:43:16,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:43:16,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:16,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:43:16,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:43:16,466 INFO L87 Difference]: Start difference. First operand 15703 states and 49208 transitions. Second operand 5 states. [2019-12-07 10:43:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:16,569 INFO L93 Difference]: Finished difference Result 40130 states and 126238 transitions. [2019-12-07 10:43:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:43:16,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-07 10:43:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:16,598 INFO L225 Difference]: With dead ends: 40130 [2019-12-07 10:43:16,598 INFO L226 Difference]: Without dead ends: 24875 [2019-12-07 10:43:16,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:43:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24875 states. [2019-12-07 10:43:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24875 to 15039. [2019-12-07 10:43:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15039 states. [2019-12-07 10:43:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15039 states to 15039 states and 47210 transitions. [2019-12-07 10:43:16,964 INFO L78 Accepts]: Start accepts. Automaton has 15039 states and 47210 transitions. Word has length 56 [2019-12-07 10:43:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:16,964 INFO L462 AbstractCegarLoop]: Abstraction has 15039 states and 47210 transitions. [2019-12-07 10:43:16,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:43:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 15039 states and 47210 transitions. [2019-12-07 10:43:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:16,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:16,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:16,976 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1502708477, now seen corresponding path program 2 times [2019-12-07 10:43:16,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:16,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319683780] [2019-12-07 10:43:16,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:17,038 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:43:17,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319683780] [2019-12-07 10:43:17,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:17,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:43:17,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39886311] [2019-12-07 10:43:17,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:43:17,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:17,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:43:17,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:43:17,039 INFO L87 Difference]: Start difference. First operand 15039 states and 47210 transitions. Second operand 5 states. [2019-12-07 10:43:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:17,148 INFO L93 Difference]: Finished difference Result 41917 states and 132174 transitions. [2019-12-07 10:43:17,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:43:17,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-07 10:43:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:17,157 INFO L225 Difference]: With dead ends: 41917 [2019-12-07 10:43:17,157 INFO L226 Difference]: Without dead ends: 8422 [2019-12-07 10:43:17,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:43:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2019-12-07 10:43:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 8422. [2019-12-07 10:43:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8422 states. [2019-12-07 10:43:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8422 states to 8422 states and 26581 transitions. [2019-12-07 10:43:17,273 INFO L78 Accepts]: Start accepts. Automaton has 8422 states and 26581 transitions. Word has length 56 [2019-12-07 10:43:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:17,273 INFO L462 AbstractCegarLoop]: Abstraction has 8422 states and 26581 transitions. [2019-12-07 10:43:17,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:43:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 8422 states and 26581 transitions. [2019-12-07 10:43:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:17,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:17,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:17,280 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 3 times [2019-12-07 10:43:17,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:17,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320727434] [2019-12-07 10:43:17,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:17,657 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:43:17,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320727434] [2019-12-07 10:43:17,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:17,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:43:17,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202962140] [2019-12-07 10:43:17,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:43:17,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:17,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:43:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:43:17,659 INFO L87 Difference]: Start difference. First operand 8422 states and 26581 transitions. Second operand 15 states. [2019-12-07 10:43:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:22,657 INFO L93 Difference]: Finished difference Result 19397 states and 60115 transitions. [2019-12-07 10:43:22,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-07 10:43:22,657 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 10:43:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:22,677 INFO L225 Difference]: With dead ends: 19397 [2019-12-07 10:43:22,677 INFO L226 Difference]: Without dead ends: 18543 [2019-12-07 10:43:22,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1742 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=733, Invalid=4669, Unknown=0, NotChecked=0, Total=5402 [2019-12-07 10:43:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18543 states. [2019-12-07 10:43:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18543 to 14010. [2019-12-07 10:43:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14010 states. [2019-12-07 10:43:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14010 states to 14010 states and 43895 transitions. [2019-12-07 10:43:22,892 INFO L78 Accepts]: Start accepts. Automaton has 14010 states and 43895 transitions. Word has length 56 [2019-12-07 10:43:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:22,892 INFO L462 AbstractCegarLoop]: Abstraction has 14010 states and 43895 transitions. [2019-12-07 10:43:22,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:43:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 14010 states and 43895 transitions. [2019-12-07 10:43:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:22,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:22,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:22,904 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:22,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323349, now seen corresponding path program 4 times [2019-12-07 10:43:22,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:22,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306477029] [2019-12-07 10:43:22,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:23,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306477029] [2019-12-07 10:43:23,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:23,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:43:23,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029504228] [2019-12-07 10:43:23,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:43:23,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:23,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:43:23,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:43:23,260 INFO L87 Difference]: Start difference. First operand 14010 states and 43895 transitions. Second operand 15 states. [2019-12-07 10:43:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:26,445 INFO L93 Difference]: Finished difference Result 19115 states and 58441 transitions. [2019-12-07 10:43:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-07 10:43:26,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 10:43:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:26,457 INFO L225 Difference]: With dead ends: 19115 [2019-12-07 10:43:26,457 INFO L226 Difference]: Without dead ends: 12027 [2019-12-07 10:43:26,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=645, Invalid=3261, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 10:43:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12027 states. [2019-12-07 10:43:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12027 to 10454. [2019-12-07 10:43:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10454 states. [2019-12-07 10:43:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10454 states to 10454 states and 32365 transitions. [2019-12-07 10:43:26,606 INFO L78 Accepts]: Start accepts. Automaton has 10454 states and 32365 transitions. Word has length 56 [2019-12-07 10:43:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:26,606 INFO L462 AbstractCegarLoop]: Abstraction has 10454 states and 32365 transitions. [2019-12-07 10:43:26,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:43:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 10454 states and 32365 transitions. [2019-12-07 10:43:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:26,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:26,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:26,615 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash 208159905, now seen corresponding path program 5 times [2019-12-07 10:43:26,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:26,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752551233] [2019-12-07 10:43:26,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:27,043 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:43:27,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752551233] [2019-12-07 10:43:27,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:27,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 10:43:27,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681208478] [2019-12-07 10:43:27,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 10:43:27,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 10:43:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:43:27,044 INFO L87 Difference]: Start difference. First operand 10454 states and 32365 transitions. Second operand 17 states. [2019-12-07 10:43:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:32,158 INFO L93 Difference]: Finished difference Result 12787 states and 38290 transitions. [2019-12-07 10:43:32,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-07 10:43:32,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-07 10:43:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:32,170 INFO L225 Difference]: With dead ends: 12787 [2019-12-07 10:43:32,171 INFO L226 Difference]: Without dead ends: 11787 [2019-12-07 10:43:32,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=429, Invalid=2223, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 10:43:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11787 states. [2019-12-07 10:43:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11787 to 10386. [2019-12-07 10:43:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10386 states. [2019-12-07 10:43:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10386 states to 10386 states and 32137 transitions. [2019-12-07 10:43:32,318 INFO L78 Accepts]: Start accepts. Automaton has 10386 states and 32137 transitions. Word has length 56 [2019-12-07 10:43:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:32,318 INFO L462 AbstractCegarLoop]: Abstraction has 10386 states and 32137 transitions. [2019-12-07 10:43:32,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 10:43:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 10386 states and 32137 transitions. [2019-12-07 10:43:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:32,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:32,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:32,326 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1327897071, now seen corresponding path program 6 times [2019-12-07 10:43:32,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:32,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459802500] [2019-12-07 10:43:32,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:32,477 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:43:32,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459802500] [2019-12-07 10:43:32,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:32,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:43:32,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830128166] [2019-12-07 10:43:32,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:43:32,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:43:32,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:43:32,478 INFO L87 Difference]: Start difference. First operand 10386 states and 32137 transitions. Second operand 12 states. [2019-12-07 10:43:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:33,883 INFO L93 Difference]: Finished difference Result 22741 states and 69092 transitions. [2019-12-07 10:43:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 10:43:33,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 10:43:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:33,899 INFO L225 Difference]: With dead ends: 22741 [2019-12-07 10:43:33,899 INFO L226 Difference]: Without dead ends: 14256 [2019-12-07 10:43:33,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 10:43:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14256 states. [2019-12-07 10:43:34,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14256 to 11115. [2019-12-07 10:43:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11115 states. [2019-12-07 10:43:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11115 states to 11115 states and 33835 transitions. [2019-12-07 10:43:34,064 INFO L78 Accepts]: Start accepts. Automaton has 11115 states and 33835 transitions. Word has length 56 [2019-12-07 10:43:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:34,064 INFO L462 AbstractCegarLoop]: Abstraction has 11115 states and 33835 transitions. [2019-12-07 10:43:34,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:43:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11115 states and 33835 transitions. [2019-12-07 10:43:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:34,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:34,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:34,074 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash 736614263, now seen corresponding path program 7 times [2019-12-07 10:43:34,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:34,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794140366] [2019-12-07 10:43:34,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:34,264 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:43:34,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794140366] [2019-12-07 10:43:34,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:34,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:43:34,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100286237] [2019-12-07 10:43:34,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:43:34,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:43:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:43:34,265 INFO L87 Difference]: Start difference. First operand 11115 states and 33835 transitions. Second operand 13 states. [2019-12-07 10:43:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:36,117 INFO L93 Difference]: Finished difference Result 19987 states and 60168 transitions. [2019-12-07 10:43:36,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 10:43:36,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-07 10:43:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:36,131 INFO L225 Difference]: With dead ends: 19987 [2019-12-07 10:43:36,131 INFO L226 Difference]: Without dead ends: 12871 [2019-12-07 10:43:36,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 10:43:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states. [2019-12-07 10:43:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 10433. [2019-12-07 10:43:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10433 states. [2019-12-07 10:43:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10433 states to 10433 states and 31921 transitions. [2019-12-07 10:43:36,283 INFO L78 Accepts]: Start accepts. Automaton has 10433 states and 31921 transitions. Word has length 56 [2019-12-07 10:43:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:36,284 INFO L462 AbstractCegarLoop]: Abstraction has 10433 states and 31921 transitions. [2019-12-07 10:43:36,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:43:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 10433 states and 31921 transitions. [2019-12-07 10:43:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:36,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:36,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:36,292 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1234081509, now seen corresponding path program 8 times [2019-12-07 10:43:36,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:36,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110890408] [2019-12-07 10:43:36,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:36,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110890408] [2019-12-07 10:43:36,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:36,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:43:36,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6790795] [2019-12-07 10:43:36,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:43:36,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:36,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:43:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:43:36,588 INFO L87 Difference]: Start difference. First operand 10433 states and 31921 transitions. Second operand 15 states. [2019-12-07 10:43:38,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:38,733 INFO L93 Difference]: Finished difference Result 16728 states and 49441 transitions. [2019-12-07 10:43:38,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 10:43:38,734 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 10:43:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:38,762 INFO L225 Difference]: With dead ends: 16728 [2019-12-07 10:43:38,762 INFO L226 Difference]: Without dead ends: 14023 [2019-12-07 10:43:38,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 10:43:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14023 states. [2019-12-07 10:43:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14023 to 10435. [2019-12-07 10:43:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10435 states. [2019-12-07 10:43:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10435 states to 10435 states and 31928 transitions. [2019-12-07 10:43:38,923 INFO L78 Accepts]: Start accepts. Automaton has 10435 states and 31928 transitions. Word has length 56 [2019-12-07 10:43:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:38,923 INFO L462 AbstractCegarLoop]: Abstraction has 10435 states and 31928 transitions. [2019-12-07 10:43:38,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:43:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 10435 states and 31928 transitions. [2019-12-07 10:43:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:38,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:38,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:38,932 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:38,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash -852564793, now seen corresponding path program 9 times [2019-12-07 10:43:38,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:38,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832308309] [2019-12-07 10:43:38,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:39,073 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:43:39,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832308309] [2019-12-07 10:43:39,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:39,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:43:39,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029823402] [2019-12-07 10:43:39,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:43:39,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:43:39,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:43:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:43:39,074 INFO L87 Difference]: Start difference. First operand 10435 states and 31928 transitions. Second operand 10 states. [2019-12-07 10:43:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:39,842 INFO L93 Difference]: Finished difference Result 16026 states and 48232 transitions. [2019-12-07 10:43:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 10:43:39,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 10:43:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:39,856 INFO L225 Difference]: With dead ends: 16026 [2019-12-07 10:43:39,857 INFO L226 Difference]: Without dead ends: 11757 [2019-12-07 10:43:39,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:43:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11757 states. [2019-12-07 10:43:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11757 to 10255. [2019-12-07 10:43:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10255 states. [2019-12-07 10:43:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10255 states to 10255 states and 31357 transitions. [2019-12-07 10:43:40,006 INFO L78 Accepts]: Start accepts. Automaton has 10255 states and 31357 transitions. Word has length 56 [2019-12-07 10:43:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:40,007 INFO L462 AbstractCegarLoop]: Abstraction has 10255 states and 31357 transitions. [2019-12-07 10:43:40,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:43:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 10255 states and 31357 transitions. [2019-12-07 10:43:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:43:40,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:40,015 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:40,015 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:40,015 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 10 times [2019-12-07 10:43:40,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:43:40,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752574872] [2019-12-07 10:43:40,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:43:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:43:40,091 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:43:40,091 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:43:40,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_39|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1831~0.base_39| 4) |v_#length_23|) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1831~0.base_39|) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_ULTIMATE.start_main_~#t1831~0.offset_25| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_39|) |v_ULTIMATE.start_main_~#t1831~0.offset_25| 0))) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_39| 1)) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_37|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_~#t1831~0.offset=|v_ULTIMATE.start_main_~#t1831~0.offset_25|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ULTIMATE.start_main_~#t1831~0.base=|v_ULTIMATE.start_main_~#t1831~0.base_39|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1831~0.offset, ULTIMATE.start_main_~#t1833~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1832~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1832~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1833~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1831~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:43:40,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1832~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t1832~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10|) |v_ULTIMATE.start_main_~#t1832~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1832~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1832~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_10|, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1832~0.offset, ULTIMATE.start_main_~#t1832~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 10:43:40,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10|) |v_ULTIMATE.start_main_~#t1833~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1833~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1833~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1833~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1833~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1833~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:43:40,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:43:40,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-123924576 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-123924576 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-123924576| ~x~0_In-123924576) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-123924576| ~x$w_buff1~0_In-123924576) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-123924576, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-123924576, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-123924576, ~x~0=~x~0_In-123924576} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-123924576|, ~x$w_buff1~0=~x$w_buff1~0_In-123924576, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-123924576, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-123924576, ~x~0=~x~0_In-123924576} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 10:43:40,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1529242049 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1529242049 256) 0))) (or (and (= ~x$w_buff0_used~0_In1529242049 |P1Thread1of1ForFork0_#t~ite28_Out1529242049|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1529242049|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1529242049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1529242049} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1529242049, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1529242049|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1529242049} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:43:40,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 10:43:40,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1444748635 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1444748635 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1444748635 |P2Thread1of1ForFork1_#t~ite34_Out-1444748635|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1444748635|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1444748635, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1444748635} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1444748635|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1444748635, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1444748635} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 10:43:40,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-2139498392 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-2139498392 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2139498392 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2139498392 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2139498392 |P1Thread1of1ForFork0_#t~ite29_Out-2139498392|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out-2139498392| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2139498392, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2139498392, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2139498392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139498392} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2139498392, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2139498392, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2139498392, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2139498392|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139498392} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:43:40,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In1391637914 ~x$r_buff0_thd2~0_Out1391637914)) (.cse0 (= (mod ~x$w_buff0_used~0_In1391637914 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1391637914 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1391637914) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1391637914, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391637914} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1391637914|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1391637914, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391637914} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:43:40,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-948466925 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-948466925 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-948466925 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-948466925 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-948466925| ~x$r_buff1_thd2~0_In-948466925)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-948466925| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-948466925, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-948466925, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-948466925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-948466925} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-948466925|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-948466925, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-948466925, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-948466925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-948466925} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:43:40,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_44|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 10:43:40,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-582565416 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-582565416 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-582565416 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-582565416 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-582565416|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-582565416 |P2Thread1of1ForFork1_#t~ite35_Out-582565416|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-582565416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-582565416, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-582565416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-582565416} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-582565416|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582565416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-582565416, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-582565416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-582565416} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 10:43:40,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-418733261 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-418733261 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-418733261|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-418733261 |P2Thread1of1ForFork1_#t~ite36_Out-418733261|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-418733261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418733261} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-418733261|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-418733261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418733261} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 10:43:40,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-68623336 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out-68623336| |P0Thread1of1ForFork2_#t~ite11_Out-68623336|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-68623336 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-68623336 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-68623336 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-68623336 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite11_Out-68623336| ~x$w_buff1~0_In-68623336)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-68623336| |P0Thread1of1ForFork2_#t~ite11_Out-68623336|) (= |P0Thread1of1ForFork2_#t~ite12_Out-68623336| ~x$w_buff1~0_In-68623336)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-68623336, ~x$w_buff1~0=~x$w_buff1~0_In-68623336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-68623336, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-68623336, ~weak$$choice2~0=~weak$$choice2~0_In-68623336, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-68623336|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-68623336} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-68623336, ~x$w_buff1~0=~x$w_buff1~0_In-68623336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-68623336, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-68623336, ~weak$$choice2~0=~weak$$choice2~0_In-68623336, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-68623336|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-68623336|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-68623336} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:43:40,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1877650604 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-1877650604| |P0Thread1of1ForFork2_#t~ite14_Out-1877650604|) (= ~x$w_buff0_used~0_In-1877650604 |P0Thread1of1ForFork2_#t~ite15_Out-1877650604|)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out-1877650604| ~x$w_buff0_used~0_In-1877650604) (= |P0Thread1of1ForFork2_#t~ite14_Out-1877650604| |P0Thread1of1ForFork2_#t~ite15_Out-1877650604|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1877650604 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1877650604 256))) (= (mod ~x$w_buff0_used~0_In-1877650604 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1877650604 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1877650604, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1877650604, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1877650604, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1877650604|, ~weak$$choice2~0=~weak$$choice2~0_In-1877650604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1877650604} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1877650604, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1877650604, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1877650604|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1877650604, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1877650604|, ~weak$$choice2~0=~weak$$choice2~0_In-1877650604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1877650604} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 10:43:40,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 10:43:40,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1705953047 256)))) (or (and (not .cse0) (= ~x$r_buff1_thd1~0_In-1705953047 |P0Thread1of1ForFork2_#t~ite24_Out-1705953047|) (= |P0Thread1of1ForFork2_#t~ite23_In-1705953047| |P0Thread1of1ForFork2_#t~ite23_Out-1705953047|)) (and (= |P0Thread1of1ForFork2_#t~ite24_Out-1705953047| |P0Thread1of1ForFork2_#t~ite23_Out-1705953047|) .cse0 (= ~x$r_buff1_thd1~0_In-1705953047 |P0Thread1of1ForFork2_#t~ite23_Out-1705953047|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1705953047 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1705953047 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1705953047 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1705953047 256)) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1705953047, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1705953047, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1705953047, ~weak$$choice2~0=~weak$$choice2~0_In-1705953047, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1705953047|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705953047} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1705953047, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1705953047, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1705953047, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1705953047|, ~weak$$choice2~0=~weak$$choice2~0_In-1705953047, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1705953047|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705953047} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 10:43:40,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 10:43:40,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1695837319 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1695837319 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1695837319 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1695837319 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1695837319| ~x$r_buff1_thd3~0_In-1695837319) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1695837319|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1695837319, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1695837319, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1695837319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695837319} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1695837319|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1695837319, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1695837319, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1695837319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695837319} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:43:40,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 10:43:40,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:43:40,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out1430483908| |ULTIMATE.start_main_#t~ite42_Out1430483908|)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1430483908 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1430483908 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite41_Out1430483908| ~x$w_buff1~0_In1430483908)) (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out1430483908| ~x~0_In1430483908) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1430483908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430483908, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1430483908, ~x~0=~x~0_In1430483908} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1430483908|, ~x$w_buff1~0=~x$w_buff1~0_In1430483908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430483908, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1430483908, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1430483908|, ~x~0=~x~0_In1430483908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:43:40,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1734616875 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1734616875 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1734616875| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out1734616875| ~x$w_buff0_used~0_In1734616875) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1734616875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734616875} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1734616875, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1734616875|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734616875} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:43:40,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1680256027 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1680256027 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1680256027 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1680256027 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1680256027 |ULTIMATE.start_main_#t~ite44_Out-1680256027|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1680256027|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1680256027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680256027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1680256027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680256027} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1680256027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680256027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1680256027, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1680256027|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680256027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:43:40,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In163587199 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In163587199 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In163587199 |ULTIMATE.start_main_#t~ite45_Out163587199|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out163587199|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In163587199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163587199} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In163587199, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out163587199|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163587199} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:43:40,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1465886552 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1465886552 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1465886552 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1465886552 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1465886552| ~x$r_buff1_thd0~0_In1465886552) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out1465886552| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1465886552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1465886552, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1465886552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465886552} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1465886552, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1465886552|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1465886552, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1465886552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465886552} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:43:40,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:43:40,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:43:40 BasicIcfg [2019-12-07 10:43:40,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:43:40,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:43:40,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:43:40,165 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:43:40,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:07" (3/4) ... [2019-12-07 10:43:40,168 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:43:40,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_39|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1831~0.base_39| 4) |v_#length_23|) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1831~0.base_39|) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_ULTIMATE.start_main_~#t1831~0.offset_25| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_39|) |v_ULTIMATE.start_main_~#t1831~0.offset_25| 0))) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_39| 1)) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_37|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_~#t1831~0.offset=|v_ULTIMATE.start_main_~#t1831~0.offset_25|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ULTIMATE.start_main_~#t1831~0.base=|v_ULTIMATE.start_main_~#t1831~0.base_39|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1831~0.offset, ULTIMATE.start_main_~#t1833~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1832~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1832~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1833~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1831~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:43:40,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1832~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t1832~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10|) |v_ULTIMATE.start_main_~#t1832~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1832~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1832~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_10|, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1832~0.offset, ULTIMATE.start_main_~#t1832~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 10:43:40,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10|) |v_ULTIMATE.start_main_~#t1833~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1833~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1833~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1833~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1833~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1833~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:43:40,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:43:40,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-123924576 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-123924576 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-123924576| ~x~0_In-123924576) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-123924576| ~x$w_buff1~0_In-123924576) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-123924576, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-123924576, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-123924576, ~x~0=~x~0_In-123924576} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-123924576|, ~x$w_buff1~0=~x$w_buff1~0_In-123924576, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-123924576, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-123924576, ~x~0=~x~0_In-123924576} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 10:43:40,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1529242049 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1529242049 256) 0))) (or (and (= ~x$w_buff0_used~0_In1529242049 |P1Thread1of1ForFork0_#t~ite28_Out1529242049|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1529242049|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1529242049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1529242049} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1529242049, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1529242049|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1529242049} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:43:40,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 10:43:40,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1444748635 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1444748635 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1444748635 |P2Thread1of1ForFork1_#t~ite34_Out-1444748635|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1444748635|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1444748635, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1444748635} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1444748635|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1444748635, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1444748635} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 10:43:40,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-2139498392 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-2139498392 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2139498392 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2139498392 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2139498392 |P1Thread1of1ForFork0_#t~ite29_Out-2139498392|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out-2139498392| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2139498392, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2139498392, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2139498392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139498392} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2139498392, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2139498392, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2139498392, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2139498392|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139498392} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:43:40,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In1391637914 ~x$r_buff0_thd2~0_Out1391637914)) (.cse0 (= (mod ~x$w_buff0_used~0_In1391637914 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1391637914 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1391637914) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1391637914, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391637914} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1391637914|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1391637914, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391637914} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:43:40,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-948466925 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-948466925 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-948466925 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-948466925 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-948466925| ~x$r_buff1_thd2~0_In-948466925)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-948466925| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-948466925, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-948466925, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-948466925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-948466925} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-948466925|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-948466925, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-948466925, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-948466925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-948466925} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:43:40,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_44|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 10:43:40,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-582565416 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-582565416 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-582565416 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-582565416 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-582565416|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-582565416 |P2Thread1of1ForFork1_#t~ite35_Out-582565416|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-582565416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-582565416, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-582565416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-582565416} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-582565416|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582565416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-582565416, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-582565416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-582565416} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 10:43:40,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-418733261 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-418733261 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-418733261|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-418733261 |P2Thread1of1ForFork1_#t~ite36_Out-418733261|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-418733261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418733261} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-418733261|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-418733261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418733261} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 10:43:40,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-68623336 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out-68623336| |P0Thread1of1ForFork2_#t~ite11_Out-68623336|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-68623336 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-68623336 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-68623336 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-68623336 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite11_Out-68623336| ~x$w_buff1~0_In-68623336)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-68623336| |P0Thread1of1ForFork2_#t~ite11_Out-68623336|) (= |P0Thread1of1ForFork2_#t~ite12_Out-68623336| ~x$w_buff1~0_In-68623336)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-68623336, ~x$w_buff1~0=~x$w_buff1~0_In-68623336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-68623336, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-68623336, ~weak$$choice2~0=~weak$$choice2~0_In-68623336, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-68623336|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-68623336} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-68623336, ~x$w_buff1~0=~x$w_buff1~0_In-68623336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-68623336, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-68623336, ~weak$$choice2~0=~weak$$choice2~0_In-68623336, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-68623336|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-68623336|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-68623336} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:43:40,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1877650604 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-1877650604| |P0Thread1of1ForFork2_#t~ite14_Out-1877650604|) (= ~x$w_buff0_used~0_In-1877650604 |P0Thread1of1ForFork2_#t~ite15_Out-1877650604|)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out-1877650604| ~x$w_buff0_used~0_In-1877650604) (= |P0Thread1of1ForFork2_#t~ite14_Out-1877650604| |P0Thread1of1ForFork2_#t~ite15_Out-1877650604|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1877650604 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1877650604 256))) (= (mod ~x$w_buff0_used~0_In-1877650604 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1877650604 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1877650604, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1877650604, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1877650604, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1877650604|, ~weak$$choice2~0=~weak$$choice2~0_In-1877650604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1877650604} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1877650604, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1877650604, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1877650604|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1877650604, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1877650604|, ~weak$$choice2~0=~weak$$choice2~0_In-1877650604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1877650604} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 10:43:40,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 10:43:40,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1705953047 256)))) (or (and (not .cse0) (= ~x$r_buff1_thd1~0_In-1705953047 |P0Thread1of1ForFork2_#t~ite24_Out-1705953047|) (= |P0Thread1of1ForFork2_#t~ite23_In-1705953047| |P0Thread1of1ForFork2_#t~ite23_Out-1705953047|)) (and (= |P0Thread1of1ForFork2_#t~ite24_Out-1705953047| |P0Thread1of1ForFork2_#t~ite23_Out-1705953047|) .cse0 (= ~x$r_buff1_thd1~0_In-1705953047 |P0Thread1of1ForFork2_#t~ite23_Out-1705953047|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1705953047 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1705953047 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1705953047 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1705953047 256)) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1705953047, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1705953047, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1705953047, ~weak$$choice2~0=~weak$$choice2~0_In-1705953047, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1705953047|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705953047} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1705953047, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1705953047, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1705953047, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1705953047|, ~weak$$choice2~0=~weak$$choice2~0_In-1705953047, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1705953047|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705953047} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 10:43:40,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 10:43:40,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1695837319 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1695837319 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1695837319 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1695837319 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1695837319| ~x$r_buff1_thd3~0_In-1695837319) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1695837319|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1695837319, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1695837319, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1695837319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695837319} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1695837319|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1695837319, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1695837319, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1695837319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695837319} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:43:40,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 10:43:40,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:43:40,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out1430483908| |ULTIMATE.start_main_#t~ite42_Out1430483908|)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1430483908 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1430483908 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite41_Out1430483908| ~x$w_buff1~0_In1430483908)) (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out1430483908| ~x~0_In1430483908) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1430483908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430483908, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1430483908, ~x~0=~x~0_In1430483908} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1430483908|, ~x$w_buff1~0=~x$w_buff1~0_In1430483908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430483908, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1430483908, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1430483908|, ~x~0=~x~0_In1430483908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:43:40,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1734616875 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1734616875 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1734616875| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out1734616875| ~x$w_buff0_used~0_In1734616875) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1734616875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734616875} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1734616875, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1734616875|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734616875} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:43:40,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1680256027 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1680256027 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1680256027 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1680256027 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1680256027 |ULTIMATE.start_main_#t~ite44_Out-1680256027|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1680256027|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1680256027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680256027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1680256027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680256027} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1680256027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680256027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1680256027, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1680256027|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680256027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:43:40,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In163587199 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In163587199 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In163587199 |ULTIMATE.start_main_#t~ite45_Out163587199|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out163587199|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In163587199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163587199} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In163587199, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out163587199|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163587199} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:43:40,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1465886552 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1465886552 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1465886552 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1465886552 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1465886552| ~x$r_buff1_thd0~0_In1465886552) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out1465886552| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1465886552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1465886552, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1465886552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465886552} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1465886552, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1465886552|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1465886552, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1465886552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465886552} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:43:40,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:43:40,234 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_35db8955-a213-4c8f-94a9-922b5d250d0c/bin/uautomizer/witness.graphml [2019-12-07 10:43:40,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:43:40,235 INFO L168 Benchmark]: Toolchain (without parser) took 93603.95 ms. Allocated memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: 5.1 GB). Free memory was 938.3 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 10:43:40,235 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:43:40,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:43:40,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.65 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:43:40,236 INFO L168 Benchmark]: Boogie Preprocessor took 24.23 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:43:40,237 INFO L168 Benchmark]: RCFGBuilder took 395.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:43:40,237 INFO L168 Benchmark]: TraceAbstraction took 92678.32 ms. Allocated memory was 1.1 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 10:43:40,237 INFO L168 Benchmark]: Witness Printer took 68.83 ms. Allocated memory is still 6.1 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:43:40,239 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 395.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92678.32 ms. Allocated memory was 1.1 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 68.83 ms. Allocated memory is still 6.1 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1831, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1832, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1833, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 92.5s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 33.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4159 SDtfs, 6943 SDslu, 16064 SDs, 0 SdLazy, 18902 SolverSat, 521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 33 SyntacticMatches, 21 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4621 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237827occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 174937 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 989 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 290425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...