./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/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 b489af13ce6bcf52b3708636354333aba8792e2c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:07:01,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:07:01,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:07:01,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:07:01,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:07:01,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:07:01,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:07:01,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:07:01,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:07:01,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:07:01,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:07:01,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:07:01,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:07:01,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:07:01,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:07:01,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:07:01,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:07:01,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:07:01,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:07:01,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:07:01,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:07:01,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:07:01,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:07:01,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:07:01,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:07:01,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:07:01,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:07:01,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:07:01,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:07:01,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:07:01,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:07:01,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:07:01,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:07:01,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:07:01,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:07:01,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:07:01,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:07:01,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:07:01,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:07:01,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:07:01,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:07:01,987 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:07:01,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:07:01,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:07:01,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:07:01,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:07:01,999 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:07:01,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:07:02,000 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:07:02,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:07:02,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:07:02,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:07:02,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:07:02,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:07:02,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:07:02,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:07:02,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:07:02,001 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:07:02,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:07:02,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:07:02,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:07:02,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:07:02,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:07:02,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:07:02,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:07:02,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:07:02,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:07:02,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:07:02,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:07:02,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:07:02,003 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:07:02,003 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_75478aff-4772-4601-a017-9d70913d808a/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 -> b489af13ce6bcf52b3708636354333aba8792e2c [2019-12-07 13:07:02,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:07:02,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:07:02,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:07:02,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:07:02,129 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:07:02,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix039_tso.opt.i [2019-12-07 13:07:02,171 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/data/584d0cd94/cbd1f59fcd1640a49137c53d3945d6ff/FLAG32e50cd25 [2019-12-07 13:07:02,655 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:07:02,656 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/sv-benchmarks/c/pthread-wmm/mix039_tso.opt.i [2019-12-07 13:07:02,665 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/data/584d0cd94/cbd1f59fcd1640a49137c53d3945d6ff/FLAG32e50cd25 [2019-12-07 13:07:02,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/data/584d0cd94/cbd1f59fcd1640a49137c53d3945d6ff [2019-12-07 13:07:02,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:07:02,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:07:02,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:07:02,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:07:02,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:07:02,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:07:02" (1/1) ... [2019-12-07 13:07:02,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:02, skipping insertion in model container [2019-12-07 13:07:02,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:07:02" (1/1) ... [2019-12-07 13:07:02,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:07:02,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:07:02,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:07:02,957 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:07:02,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:07:03,044 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:07:03,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03 WrapperNode [2019-12-07 13:07:03,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:07:03,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:07:03,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:07:03,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:07:03,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... [2019-12-07 13:07:03,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... [2019-12-07 13:07:03,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:07:03,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:07:03,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:07:03,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:07:03,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... [2019-12-07 13:07:03,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... [2019-12-07 13:07:03,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... [2019-12-07 13:07:03,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... [2019-12-07 13:07:03,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... [2019-12-07 13:07:03,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... [2019-12-07 13:07:03,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... [2019-12-07 13:07:03,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:07:03,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:07:03,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:07:03,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:07:03,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/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 13:07:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:07:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:07:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:07:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:07:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:07:03,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:07:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:07:03,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:07:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:07:03,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:07:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:07:03,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:07:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:07:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:07:03,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:07:03,153 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 13:07:03,508 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:07:03,508 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:07:03,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:07:03 BoogieIcfgContainer [2019-12-07 13:07:03,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:07:03,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:07:03,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:07:03,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:07:03,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:07:02" (1/3) ... [2019-12-07 13:07:03,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de8782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:07:03, skipping insertion in model container [2019-12-07 13:07:03,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:03" (2/3) ... [2019-12-07 13:07:03,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de8782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:07:03, skipping insertion in model container [2019-12-07 13:07:03,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:07:03" (3/3) ... [2019-12-07 13:07:03,515 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_tso.opt.i [2019-12-07 13:07:03,521 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:07:03,522 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:07:03,526 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:07:03,527 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:07:03,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,556 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,556 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,573 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,573 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,573 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,573 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,574 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:03,593 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:07:03,610 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:07:03,610 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:07:03,611 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:07:03,611 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:07:03,611 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:07:03,611 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:07:03,611 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:07:03,611 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:07:03,625 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-07 13:07:03,626 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 13:07:03,677 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 13:07:03,678 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:07:03,687 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 13:07:03,700 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 13:07:03,726 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 13:07:03,726 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:07:03,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 13:07:03,741 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 13:07:03,742 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:07:06,554 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 13:07:06,800 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 13:07:06,892 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-07 13:07:06,892 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 13:07:06,894 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-07 13:07:07,870 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-07 13:07:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-07 13:07:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:07:07,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:07,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:07:07,876 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-07 13:07:07,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:07,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423784975] [2019-12-07 13:07:07,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:08,037 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 13:07:08,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423784975] [2019-12-07 13:07:08,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:08,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:07:08,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003628759] [2019-12-07 13:07:08,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:07:08,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:08,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:07:08,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:07:08,052 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-07 13:07:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:08,344 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-07 13:07:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:07:08,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:07:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:08,487 INFO L225 Difference]: With dead ends: 20958 [2019-12-07 13:07:08,487 INFO L226 Difference]: Without dead ends: 19662 [2019-12-07 13:07:08,488 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 13:07:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-07 13:07:09,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-07 13:07:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-07 13:07:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-07 13:07:09,177 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-07 13:07:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:09,178 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-07 13:07:09,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:07:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-07 13:07:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:07:09,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:09,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:07:09,185 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:09,186 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-07 13:07:09,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:09,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879164085] [2019-12-07 13:07:09,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:09,247 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 13:07:09,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879164085] [2019-12-07 13:07:09,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:09,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:07:09,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562236260] [2019-12-07 13:07:09,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:07:09,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:07:09,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:07:09,249 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-07 13:07:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:09,653 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-07 13:07:09,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:07:09,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:07:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:09,729 INFO L225 Difference]: With dead ends: 30494 [2019-12-07 13:07:09,729 INFO L226 Difference]: Without dead ends: 30438 [2019-12-07 13:07:09,730 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 13:07:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-07 13:07:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-07 13:07:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-07 13:07:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-07 13:07:10,353 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-07 13:07:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:10,354 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-07 13:07:10,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:07:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-07 13:07:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:07:10,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:10,359 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 13:07:10,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-07 13:07:10,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:10,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906811422] [2019-12-07 13:07:10,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:10,412 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 13:07:10,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906811422] [2019-12-07 13:07:10,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:10,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:07:10,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135837842] [2019-12-07 13:07:10,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:07:10,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:10,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:07:10,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:07:10,414 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-07 13:07:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:10,722 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-07 13:07:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:07:10,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:07:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:10,795 INFO L225 Difference]: With dead ends: 35230 [2019-12-07 13:07:10,795 INFO L226 Difference]: Without dead ends: 35182 [2019-12-07 13:07:10,796 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 13:07:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-07 13:07:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-07 13:07:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-07 13:07:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-07 13:07:11,568 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-07 13:07:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:11,568 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-07 13:07:11,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:07:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-07 13:07:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:07:11,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:11,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:07:11,576 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-07 13:07:11,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:11,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546646576] [2019-12-07 13:07:11,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:11,619 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 13:07:11,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546646576] [2019-12-07 13:07:11,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:11,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:07:11,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478065738] [2019-12-07 13:07:11,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:07:11,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:07:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:07:11,620 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-07 13:07:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:11,734 INFO L93 Difference]: Finished difference Result 30328 states and 126949 transitions. [2019-12-07 13:07:11,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:07:11,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:07:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:11,797 INFO L225 Difference]: With dead ends: 30328 [2019-12-07 13:07:11,797 INFO L226 Difference]: Without dead ends: 30328 [2019-12-07 13:07:11,798 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 13:07:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-12-07 13:07:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 30328. [2019-12-07 13:07:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30328 states. [2019-12-07 13:07:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30328 states to 30328 states and 126949 transitions. [2019-12-07 13:07:12,526 INFO L78 Accepts]: Start accepts. Automaton has 30328 states and 126949 transitions. Word has length 20 [2019-12-07 13:07:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:12,526 INFO L462 AbstractCegarLoop]: Abstraction has 30328 states and 126949 transitions. [2019-12-07 13:07:12,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:07:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 30328 states and 126949 transitions. [2019-12-07 13:07:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:07:12,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:12,536 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] [2019-12-07 13:07:12,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-07 13:07:12,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:12,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014881155] [2019-12-07 13:07:12,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:12,600 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 13:07:12,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014881155] [2019-12-07 13:07:12,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:12,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:07:12,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858253803] [2019-12-07 13:07:12,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:07:12,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:12,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:07:12,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:07:12,602 INFO L87 Difference]: Start difference. First operand 30328 states and 126949 transitions. Second operand 5 states. [2019-12-07 13:07:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:12,676 INFO L93 Difference]: Finished difference Result 12680 states and 42955 transitions. [2019-12-07 13:07:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:07:12,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 13:07:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:12,691 INFO L225 Difference]: With dead ends: 12680 [2019-12-07 13:07:12,691 INFO L226 Difference]: Without dead ends: 10728 [2019-12-07 13:07:12,691 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 13:07:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10728 states. [2019-12-07 13:07:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10728 to 10728. [2019-12-07 13:07:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10728 states. [2019-12-07 13:07:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10728 states to 10728 states and 35317 transitions. [2019-12-07 13:07:12,836 INFO L78 Accepts]: Start accepts. Automaton has 10728 states and 35317 transitions. Word has length 21 [2019-12-07 13:07:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:12,837 INFO L462 AbstractCegarLoop]: Abstraction has 10728 states and 35317 transitions. [2019-12-07 13:07:12,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:07:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 10728 states and 35317 transitions. [2019-12-07 13:07:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:07:12,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:12,839 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 13:07:12,839 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2097022487, now seen corresponding path program 1 times [2019-12-07 13:07:12,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:12,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255373122] [2019-12-07 13:07:12,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:12,895 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 13:07:12,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255373122] [2019-12-07 13:07:12,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:12,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:07:12,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74542760] [2019-12-07 13:07:12,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:07:12,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:12,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:07:12,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:07:12,897 INFO L87 Difference]: Start difference. First operand 10728 states and 35317 transitions. Second operand 4 states. [2019-12-07 13:07:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:12,948 INFO L93 Difference]: Finished difference Result 16346 states and 53809 transitions. [2019-12-07 13:07:12,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:07:12,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 13:07:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:12,968 INFO L225 Difference]: With dead ends: 16346 [2019-12-07 13:07:12,969 INFO L226 Difference]: Without dead ends: 15714 [2019-12-07 13:07:12,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:07:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15714 states. [2019-12-07 13:07:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15714 to 15659. [2019-12-07 13:07:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15659 states. [2019-12-07 13:07:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15659 states to 15659 states and 51458 transitions. [2019-12-07 13:07:13,179 INFO L78 Accepts]: Start accepts. Automaton has 15659 states and 51458 transitions. Word has length 22 [2019-12-07 13:07:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:13,179 INFO L462 AbstractCegarLoop]: Abstraction has 15659 states and 51458 transitions. [2019-12-07 13:07:13,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:07:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 15659 states and 51458 transitions. [2019-12-07 13:07:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:07:13,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:13,183 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] [2019-12-07 13:07:13,183 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1876344722, now seen corresponding path program 1 times [2019-12-07 13:07:13,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:13,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309592176] [2019-12-07 13:07:13,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:13,240 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 13:07:13,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309592176] [2019-12-07 13:07:13,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:13,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:07:13,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875161125] [2019-12-07 13:07:13,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:07:13,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:13,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:07:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:07:13,241 INFO L87 Difference]: Start difference. First operand 15659 states and 51458 transitions. Second operand 4 states. [2019-12-07 13:07:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:13,318 INFO L93 Difference]: Finished difference Result 23643 states and 77098 transitions. [2019-12-07 13:07:13,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:07:13,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 13:07:13,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:13,332 INFO L225 Difference]: With dead ends: 23643 [2019-12-07 13:07:13,332 INFO L226 Difference]: Without dead ends: 11331 [2019-12-07 13:07:13,333 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 13:07:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11331 states. [2019-12-07 13:07:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11331 to 10950. [2019-12-07 13:07:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10950 states. [2019-12-07 13:07:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10950 states to 10950 states and 34206 transitions. [2019-12-07 13:07:13,525 INFO L78 Accepts]: Start accepts. Automaton has 10950 states and 34206 transitions. Word has length 23 [2019-12-07 13:07:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:13,525 INFO L462 AbstractCegarLoop]: Abstraction has 10950 states and 34206 transitions. [2019-12-07 13:07:13,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:07:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 10950 states and 34206 transitions. [2019-12-07 13:07:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:07:13,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:13,529 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] [2019-12-07 13:07:13,529 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash -921913116, now seen corresponding path program 1 times [2019-12-07 13:07:13,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:13,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929949883] [2019-12-07 13:07:13,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:13,584 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 13:07:13,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929949883] [2019-12-07 13:07:13,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:13,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:07:13,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291612007] [2019-12-07 13:07:13,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:07:13,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:07:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:07:13,586 INFO L87 Difference]: Start difference. First operand 10950 states and 34206 transitions. Second operand 6 states. [2019-12-07 13:07:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:13,644 INFO L93 Difference]: Finished difference Result 3747 states and 10321 transitions. [2019-12-07 13:07:13,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:07:13,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 13:07:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:13,647 INFO L225 Difference]: With dead ends: 3747 [2019-12-07 13:07:13,647 INFO L226 Difference]: Without dead ends: 3064 [2019-12-07 13:07:13,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:07:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2019-12-07 13:07:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3024. [2019-12-07 13:07:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3024 states. [2019-12-07 13:07:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 8174 transitions. [2019-12-07 13:07:13,676 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 8174 transitions. Word has length 24 [2019-12-07 13:07:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:13,676 INFO L462 AbstractCegarLoop]: Abstraction has 3024 states and 8174 transitions. [2019-12-07 13:07:13,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:07:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 8174 transitions. [2019-12-07 13:07:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:07:13,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:13,679 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] [2019-12-07 13:07:13,680 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:13,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-07 13:07:13,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:13,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030022113] [2019-12-07 13:07:13,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:13,701 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 13:07:13,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030022113] [2019-12-07 13:07:13,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:13,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:07:13,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057547786] [2019-12-07 13:07:13,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:07:13,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:13,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:07:13,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:07:13,702 INFO L87 Difference]: Start difference. First operand 3024 states and 8174 transitions. Second operand 3 states. [2019-12-07 13:07:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:13,740 INFO L93 Difference]: Finished difference Result 4667 states and 12547 transitions. [2019-12-07 13:07:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:07:13,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 13:07:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:13,745 INFO L225 Difference]: With dead ends: 4667 [2019-12-07 13:07:13,745 INFO L226 Difference]: Without dead ends: 4667 [2019-12-07 13:07:13,745 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 13:07:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2019-12-07 13:07:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 3522. [2019-12-07 13:07:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3522 states. [2019-12-07 13:07:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 9618 transitions. [2019-12-07 13:07:13,785 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 9618 transitions. Word has length 32 [2019-12-07 13:07:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:13,785 INFO L462 AbstractCegarLoop]: Abstraction has 3522 states and 9618 transitions. [2019-12-07 13:07:13,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:07:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 9618 transitions. [2019-12-07 13:07:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:07:13,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:13,789 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] [2019-12-07 13:07:13,789 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-07 13:07:13,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:13,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372609009] [2019-12-07 13:07:13,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:13,841 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 13:07:13,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372609009] [2019-12-07 13:07:13,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:13,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:07:13,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036788052] [2019-12-07 13:07:13,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:07:13,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:07:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:07:13,843 INFO L87 Difference]: Start difference. First operand 3522 states and 9618 transitions. Second operand 6 states. [2019-12-07 13:07:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:14,173 INFO L93 Difference]: Finished difference Result 7205 states and 18854 transitions. [2019-12-07 13:07:14,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:07:14,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 13:07:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:14,180 INFO L225 Difference]: With dead ends: 7205 [2019-12-07 13:07:14,180 INFO L226 Difference]: Without dead ends: 7067 [2019-12-07 13:07:14,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:07:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7067 states. [2019-12-07 13:07:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7067 to 3730. [2019-12-07 13:07:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3730 states. [2019-12-07 13:07:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3730 states to 3730 states and 10113 transitions. [2019-12-07 13:07:14,232 INFO L78 Accepts]: Start accepts. Automaton has 3730 states and 10113 transitions. Word has length 32 [2019-12-07 13:07:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:14,232 INFO L462 AbstractCegarLoop]: Abstraction has 3730 states and 10113 transitions. [2019-12-07 13:07:14,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:07:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3730 states and 10113 transitions. [2019-12-07 13:07:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:07:14,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:14,235 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] [2019-12-07 13:07:14,236 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-07 13:07:14,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:14,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784309000] [2019-12-07 13:07:14,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:14,284 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 13:07:14,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784309000] [2019-12-07 13:07:14,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:14,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:07:14,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969357705] [2019-12-07 13:07:14,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:07:14,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:07:14,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:07:14,285 INFO L87 Difference]: Start difference. First operand 3730 states and 10113 transitions. Second operand 6 states. [2019-12-07 13:07:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:14,566 INFO L93 Difference]: Finished difference Result 7106 states and 18430 transitions. [2019-12-07 13:07:14,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:07:14,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 13:07:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:14,572 INFO L225 Difference]: With dead ends: 7106 [2019-12-07 13:07:14,572 INFO L226 Difference]: Without dead ends: 6974 [2019-12-07 13:07:14,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:07:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2019-12-07 13:07:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 3532. [2019-12-07 13:07:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2019-12-07 13:07:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 9603 transitions. [2019-12-07 13:07:14,618 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 9603 transitions. Word has length 33 [2019-12-07 13:07:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:14,618 INFO L462 AbstractCegarLoop]: Abstraction has 3532 states and 9603 transitions. [2019-12-07 13:07:14,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:07:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 9603 transitions. [2019-12-07 13:07:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:07:14,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:14,621 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] [2019-12-07 13:07:14,621 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -629384754, now seen corresponding path program 1 times [2019-12-07 13:07:14,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:14,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977953269] [2019-12-07 13:07:14,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:14,666 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 13:07:14,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977953269] [2019-12-07 13:07:14,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:14,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:07:14,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446059511] [2019-12-07 13:07:14,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:07:14,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:14,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:07:14,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:07:14,668 INFO L87 Difference]: Start difference. First operand 3532 states and 9603 transitions. Second operand 4 states. [2019-12-07 13:07:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:14,692 INFO L93 Difference]: Finished difference Result 5369 states and 14010 transitions. [2019-12-07 13:07:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:07:14,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 13:07:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:14,697 INFO L225 Difference]: With dead ends: 5369 [2019-12-07 13:07:14,697 INFO L226 Difference]: Without dead ends: 3230 [2019-12-07 13:07:14,697 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 13:07:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-12-07 13:07:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3230. [2019-12-07 13:07:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2019-12-07 13:07:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 8684 transitions. [2019-12-07 13:07:14,731 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 8684 transitions. Word has length 33 [2019-12-07 13:07:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:14,731 INFO L462 AbstractCegarLoop]: Abstraction has 3230 states and 8684 transitions. [2019-12-07 13:07:14,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:07:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 8684 transitions. [2019-12-07 13:07:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:07:14,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:14,734 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] [2019-12-07 13:07:14,734 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash -147077902, now seen corresponding path program 2 times [2019-12-07 13:07:14,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:14,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955942156] [2019-12-07 13:07:14,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:14,763 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 13:07:14,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955942156] [2019-12-07 13:07:14,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:14,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:07:14,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749254525] [2019-12-07 13:07:14,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:07:14,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:14,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:07:14,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:07:14,764 INFO L87 Difference]: Start difference. First operand 3230 states and 8684 transitions. Second operand 3 states. [2019-12-07 13:07:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:14,778 INFO L93 Difference]: Finished difference Result 3230 states and 8622 transitions. [2019-12-07 13:07:14,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:07:14,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 13:07:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:14,783 INFO L225 Difference]: With dead ends: 3230 [2019-12-07 13:07:14,783 INFO L226 Difference]: Without dead ends: 3230 [2019-12-07 13:07:14,783 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 13:07:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-12-07 13:07:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 2983. [2019-12-07 13:07:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2019-12-07 13:07:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 7988 transitions. [2019-12-07 13:07:14,826 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 7988 transitions. Word has length 33 [2019-12-07 13:07:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:14,827 INFO L462 AbstractCegarLoop]: Abstraction has 2983 states and 7988 transitions. [2019-12-07 13:07:14,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:07:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 7988 transitions. [2019-12-07 13:07:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:07:14,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:14,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:07:14,831 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:14,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:14,831 INFO L82 PathProgramCache]: Analyzing trace with hash -734472007, now seen corresponding path program 1 times [2019-12-07 13:07:14,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:14,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385234128] [2019-12-07 13:07:14,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:07:14,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385234128] [2019-12-07 13:07:14,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:14,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:07:14,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328385598] [2019-12-07 13:07:14,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:07:14,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:14,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:07:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:07:14,891 INFO L87 Difference]: Start difference. First operand 2983 states and 7988 transitions. Second operand 7 states. [2019-12-07 13:07:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:14,963 INFO L93 Difference]: Finished difference Result 2245 states and 6181 transitions. [2019-12-07 13:07:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:07:14,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 13:07:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:14,964 INFO L225 Difference]: With dead ends: 2245 [2019-12-07 13:07:14,964 INFO L226 Difference]: Without dead ends: 1147 [2019-12-07 13:07:14,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:07:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2019-12-07 13:07:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1111. [2019-12-07 13:07:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-12-07 13:07:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3031 transitions. [2019-12-07 13:07:14,976 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3031 transitions. Word has length 34 [2019-12-07 13:07:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:14,976 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 3031 transitions. [2019-12-07 13:07:14,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:07:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3031 transitions. [2019-12-07 13:07:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:07:14,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:14,977 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] [2019-12-07 13:07:14,978 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1894134845, now seen corresponding path program 1 times [2019-12-07 13:07:14,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:14,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071167709] [2019-12-07 13:07:14,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:15,041 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 13:07:15,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071167709] [2019-12-07 13:07:15,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:15,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:07:15,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000599877] [2019-12-07 13:07:15,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:07:15,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:15,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:07:15,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:07:15,042 INFO L87 Difference]: Start difference. First operand 1111 states and 3031 transitions. Second operand 6 states. [2019-12-07 13:07:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:15,216 INFO L93 Difference]: Finished difference Result 3306 states and 8945 transitions. [2019-12-07 13:07:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:07:15,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 13:07:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:15,219 INFO L225 Difference]: With dead ends: 3306 [2019-12-07 13:07:15,219 INFO L226 Difference]: Without dead ends: 2730 [2019-12-07 13:07:15,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:07:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2019-12-07 13:07:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1527. [2019-12-07 13:07:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-12-07 13:07:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 4069 transitions. [2019-12-07 13:07:15,238 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 4069 transitions. Word has length 48 [2019-12-07 13:07:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:15,239 INFO L462 AbstractCegarLoop]: Abstraction has 1527 states and 4069 transitions. [2019-12-07 13:07:15,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:07:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 4069 transitions. [2019-12-07 13:07:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:07:15,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:15,241 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] [2019-12-07 13:07:15,241 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:15,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:15,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1878148035, now seen corresponding path program 2 times [2019-12-07 13:07:15,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:15,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926835234] [2019-12-07 13:07:15,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:15,440 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 13:07:15,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926835234] [2019-12-07 13:07:15,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:15,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:07:15,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909740576] [2019-12-07 13:07:15,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:07:15,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:07:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:07:15,442 INFO L87 Difference]: Start difference. First operand 1527 states and 4069 transitions. Second operand 12 states. [2019-12-07 13:07:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:16,439 INFO L93 Difference]: Finished difference Result 3326 states and 8464 transitions. [2019-12-07 13:07:16,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 13:07:16,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-07 13:07:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:16,445 INFO L225 Difference]: With dead ends: 3326 [2019-12-07 13:07:16,445 INFO L226 Difference]: Without dead ends: 3257 [2019-12-07 13:07:16,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-12-07 13:07:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2019-12-07 13:07:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 1550. [2019-12-07 13:07:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-12-07 13:07:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 4140 transitions. [2019-12-07 13:07:16,478 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 4140 transitions. Word has length 48 [2019-12-07 13:07:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:16,478 INFO L462 AbstractCegarLoop]: Abstraction has 1550 states and 4140 transitions. [2019-12-07 13:07:16,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:07:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 4140 transitions. [2019-12-07 13:07:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:07:16,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:16,480 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] [2019-12-07 13:07:16,480 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1317469255, now seen corresponding path program 3 times [2019-12-07 13:07:16,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:16,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050543302] [2019-12-07 13:07:16,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:16,577 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 13:07:16,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050543302] [2019-12-07 13:07:16,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:16,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:07:16,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099575876] [2019-12-07 13:07:16,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:07:16,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:16,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:07:16,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:07:16,578 INFO L87 Difference]: Start difference. First operand 1550 states and 4140 transitions. Second operand 9 states. [2019-12-07 13:07:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:17,356 INFO L93 Difference]: Finished difference Result 6312 states and 16275 transitions. [2019-12-07 13:07:17,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 13:07:17,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-12-07 13:07:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:17,362 INFO L225 Difference]: With dead ends: 6312 [2019-12-07 13:07:17,362 INFO L226 Difference]: Without dead ends: 6106 [2019-12-07 13:07:17,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=333, Invalid=927, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 13:07:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6106 states. [2019-12-07 13:07:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6106 to 1652. [2019-12-07 13:07:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-12-07 13:07:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 4494 transitions. [2019-12-07 13:07:17,393 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 4494 transitions. Word has length 48 [2019-12-07 13:07:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:17,393 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 4494 transitions. [2019-12-07 13:07:17,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:07:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 4494 transitions. [2019-12-07 13:07:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:07:17,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:17,395 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] [2019-12-07 13:07:17,395 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:17,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1933491589, now seen corresponding path program 1 times [2019-12-07 13:07:17,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:17,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466474815] [2019-12-07 13:07:17,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:17,417 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 13:07:17,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466474815] [2019-12-07 13:07:17,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:17,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:07:17,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409893844] [2019-12-07 13:07:17,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:07:17,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:17,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:07:17,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:07:17,418 INFO L87 Difference]: Start difference. First operand 1652 states and 4494 transitions. Second operand 3 states. [2019-12-07 13:07:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:17,443 INFO L93 Difference]: Finished difference Result 1911 states and 4944 transitions. [2019-12-07 13:07:17,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:07:17,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 13:07:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:17,445 INFO L225 Difference]: With dead ends: 1911 [2019-12-07 13:07:17,445 INFO L226 Difference]: Without dead ends: 1895 [2019-12-07 13:07:17,446 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 13:07:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2019-12-07 13:07:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1579. [2019-12-07 13:07:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2019-12-07 13:07:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 4192 transitions. [2019-12-07 13:07:17,463 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 4192 transitions. Word has length 48 [2019-12-07 13:07:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:17,463 INFO L462 AbstractCegarLoop]: Abstraction has 1579 states and 4192 transitions. [2019-12-07 13:07:17,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:07:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 4192 transitions. [2019-12-07 13:07:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:07:17,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:17,465 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] [2019-12-07 13:07:17,465 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash -576774001, now seen corresponding path program 4 times [2019-12-07 13:07:17,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:17,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274078097] [2019-12-07 13:07:17,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:17,538 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 13:07:17,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274078097] [2019-12-07 13:07:17,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:17,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:07:17,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338252765] [2019-12-07 13:07:17,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:07:17,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:17,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:07:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:07:17,540 INFO L87 Difference]: Start difference. First operand 1579 states and 4192 transitions. Second operand 9 states. [2019-12-07 13:07:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:18,318 INFO L93 Difference]: Finished difference Result 5136 states and 12876 transitions. [2019-12-07 13:07:18,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 13:07:18,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-12-07 13:07:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:18,322 INFO L225 Difference]: With dead ends: 5136 [2019-12-07 13:07:18,322 INFO L226 Difference]: Without dead ends: 3764 [2019-12-07 13:07:18,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 13:07:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2019-12-07 13:07:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 1342. [2019-12-07 13:07:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-07 13:07:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3619 transitions. [2019-12-07 13:07:18,343 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3619 transitions. Word has length 48 [2019-12-07 13:07:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:18,344 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3619 transitions. [2019-12-07 13:07:18,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:07:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3619 transitions. [2019-12-07 13:07:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:07:18,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:18,345 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] [2019-12-07 13:07:18,345 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:18,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash 563742791, now seen corresponding path program 5 times [2019-12-07 13:07:18,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:18,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7543906] [2019-12-07 13:07:18,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:18,389 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 13:07:18,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7543906] [2019-12-07 13:07:18,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:18,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:07:18,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299042278] [2019-12-07 13:07:18,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:07:18,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:07:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:07:18,390 INFO L87 Difference]: Start difference. First operand 1342 states and 3619 transitions. Second operand 4 states. [2019-12-07 13:07:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:18,405 INFO L93 Difference]: Finished difference Result 1786 states and 4606 transitions. [2019-12-07 13:07:18,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:07:18,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 13:07:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:18,406 INFO L225 Difference]: With dead ends: 1786 [2019-12-07 13:07:18,406 INFO L226 Difference]: Without dead ends: 480 [2019-12-07 13:07:18,406 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 13:07:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-07 13:07:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-12-07 13:07:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-07 13:07:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1048 transitions. [2019-12-07 13:07:18,412 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1048 transitions. Word has length 48 [2019-12-07 13:07:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:18,412 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 1048 transitions. [2019-12-07 13:07:18,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:07:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1048 transitions. [2019-12-07 13:07:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:07:18,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:18,413 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] [2019-12-07 13:07:18,414 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 6 times [2019-12-07 13:07:18,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:18,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731064722] [2019-12-07 13:07:18,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:07:18,462 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 13:07:18,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731064722] [2019-12-07 13:07:18,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:07:18,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:07:18,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867295976] [2019-12-07 13:07:18,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:07:18,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:07:18,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:07:18,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:07:18,463 INFO L87 Difference]: Start difference. First operand 480 states and 1048 transitions. Second operand 7 states. [2019-12-07 13:07:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:07:18,552 INFO L93 Difference]: Finished difference Result 852 states and 1822 transitions. [2019-12-07 13:07:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:07:18,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 13:07:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:07:18,553 INFO L225 Difference]: With dead ends: 852 [2019-12-07 13:07:18,553 INFO L226 Difference]: Without dead ends: 574 [2019-12-07 13:07:18,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:07:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-12-07 13:07:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 512. [2019-12-07 13:07:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-07 13:07:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1108 transitions. [2019-12-07 13:07:18,557 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1108 transitions. Word has length 48 [2019-12-07 13:07:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:07:18,558 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 1108 transitions. [2019-12-07 13:07:18,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:07:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1108 transitions. [2019-12-07 13:07:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:07:18,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:07:18,558 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] [2019-12-07 13:07:18,559 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:07:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:07:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 7 times [2019-12-07 13:07:18,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:07:18,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501131252] [2019-12-07 13:07:18,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:07:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:07:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:07:18,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:07:18,625 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:07:18,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1053~0.base_71| 4)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_71|)) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 |v_ULTIMATE.start_main_~#t1053~0.offset_43|) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1053~0.base_71|) (= v_~z$read_delayed~0_7 0) (= |v_#NULL.offset_5| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_71| 1) |v_#valid_117|) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1053~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1053~0.base_71|) |v_ULTIMATE.start_main_~#t1053~0.offset_43| 0)) |v_#memory_int_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1053~0.offset=|v_ULTIMATE.start_main_~#t1053~0.offset_43|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1053~0.base=|v_ULTIMATE.start_main_~#t1053~0.base_71|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_24|, ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_25|, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_36|, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_36|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_68|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1053~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1053~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1055~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1056~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1054~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1055~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1054~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:07:18,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1054~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1054~0.base_11| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1054~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1054~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11|) |v_ULTIMATE.start_main_~#t1054~0.offset_10| 1)) |v_#memory_int_19|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1054~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1054~0.base] because there is no mapped edge [2019-12-07 13:07:18,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1055~0.base_12|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12|) |v_ULTIMATE.start_main_~#t1055~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t1055~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1055~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1055~0.base_12| 0)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1055~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1055~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:07:18,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1056~0.offset_10|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1056~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1056~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12|) |v_ULTIMATE.start_main_~#t1056~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1056~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_10|, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1056~0.base] because there is no mapped edge [2019-12-07 13:07:18,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff0_thd1~0_In1762638813 ~z$r_buff1_thd1~0_Out1762638813) (= ~z$r_buff1_thd3~0_Out1762638813 ~z$r_buff0_thd3~0_In1762638813) (= ~z$r_buff0_thd0~0_In1762638813 ~z$r_buff1_thd0~0_Out1762638813) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813)) (= ~z$r_buff1_thd4~0_Out1762638813 ~z$r_buff0_thd4~0_In1762638813) (= ~z$r_buff1_thd2~0_Out1762638813 ~z$r_buff0_thd2~0_In1762638813) (= ~a~0_Out1762638813 1) (= ~b~0_In1762638813 ~__unbuffered_p3_EBX~0_Out1762638813) (= ~a~0_Out1762638813 ~__unbuffered_p3_EAX~0_Out1762638813) (= 1 ~z$r_buff0_thd4~0_Out1762638813)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1762638813, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1762638813, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1762638813, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1762638813, ~a~0=~a~0_Out1762638813, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1762638813, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1762638813, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 13:07:18,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 13:07:18,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:07:18,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1590328055 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1590328055 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1590328055 256))) (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1590328055 256) 0)))) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)) (and (not .cse0) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite9_Out-1590328055|) (= |P2Thread1of1ForFork1_#t~ite8_In-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1590328055|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1590328055|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1590328055|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:07:18,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874553667 256)))) (or (and .cse0 (= ~z$w_buff1~0_In1874553667 |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1874553667 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1874553667 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1874553667 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In1874553667 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| ~z$w_buff1~0_In1874553667) (= |P2Thread1of1ForFork1_#t~ite11_In1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1874553667|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:07:18,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1210292619 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1210292619| |P2Thread1of1ForFork1_#t~ite14_Out1210292619|) (= ~z$w_buff0_used~0_In1210292619 |P2Thread1of1ForFork1_#t~ite15_Out1210292619|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1210292619 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1210292619 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))))) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| |P2Thread1of1ForFork1_#t~ite15_Out1210292619|) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| ~z$w_buff0_used~0_In1210292619) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1210292619|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 13:07:18,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 13:07:18,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-60958231 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-60958231 256)))) (or (= (mod ~z$w_buff0_used~0_In-60958231 256) 0) (and (= (mod ~z$w_buff1_used~0_In-60958231 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-60958231 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| ~z$r_buff1_thd3~0_In-60958231)) (and (= ~z$r_buff1_thd3~0_In-60958231 |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (= |P2Thread1of1ForFork1_#t~ite23_In-60958231| |P2Thread1of1ForFork1_#t~ite23_Out-60958231|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-60958231|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 13:07:18,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:07:18,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1050210907 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1050210907 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1050210907| ~z$w_buff0_used~0_In-1050210907)) (and (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1050210907|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1050210907|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:07:18,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-1401843794 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1401843794 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1401843794 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1401843794 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1401843794 |P3Thread1of1ForFork2_#t~ite29_Out-1401843794|)) (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1401843794| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1401843794|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:07:18,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In815910660 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out815910660 ~z$r_buff0_thd4~0_In815910660)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In815910660 256)))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out815910660 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In815910660} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out815910660, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out815910660|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 13:07:18,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1852831118 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1852831118 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1852831118 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1852831118 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1852831118 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1852831118|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:07:18,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:07:18,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:07:18,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1376465572 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1376465572 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1376465572| |ULTIMATE.start_main_#t~ite36_Out-1376465572|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1376465572| ~z$w_buff1~0_In-1376465572) .cse1 (not .cse2)) (and (= ~z~0_In-1376465572 |ULTIMATE.start_main_#t~ite36_Out-1376465572|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ~z~0=~z~0_In-1376465572} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1376465572|, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1376465572|, ~z~0=~z~0_In-1376465572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:07:18,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-484439986 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-484439986 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-484439986 |ULTIMATE.start_main_#t~ite38_Out-484439986|)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-484439986|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-484439986|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:07:18,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| ~z$w_buff1_used~0_In2096769610) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2096769610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:07:18,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-163914762 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-163914762 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-163914762 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-163914762|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:07:18,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In528227422 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In528227422 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In528227422 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In528227422 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out528227422|)) (and (= ~z$r_buff1_thd0~0_In528227422 |ULTIMATE.start_main_#t~ite41_Out528227422|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out528227422|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:07:18,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:07:18,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:07:18 BasicIcfg [2019-12-07 13:07:18,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:07:18,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:07:18,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:07:18,689 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:07:18,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:07:03" (3/4) ... [2019-12-07 13:07:18,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:07:18,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1053~0.base_71| 4)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_71|)) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 |v_ULTIMATE.start_main_~#t1053~0.offset_43|) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1053~0.base_71|) (= v_~z$read_delayed~0_7 0) (= |v_#NULL.offset_5| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_71| 1) |v_#valid_117|) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1053~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1053~0.base_71|) |v_ULTIMATE.start_main_~#t1053~0.offset_43| 0)) |v_#memory_int_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1053~0.offset=|v_ULTIMATE.start_main_~#t1053~0.offset_43|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1053~0.base=|v_ULTIMATE.start_main_~#t1053~0.base_71|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_24|, ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_25|, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_36|, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_36|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_68|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1053~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1053~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1055~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1056~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1054~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1055~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1054~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:07:18,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1054~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1054~0.base_11| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1054~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1054~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11|) |v_ULTIMATE.start_main_~#t1054~0.offset_10| 1)) |v_#memory_int_19|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1054~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1054~0.base] because there is no mapped edge [2019-12-07 13:07:18,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1055~0.base_12|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12|) |v_ULTIMATE.start_main_~#t1055~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t1055~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1055~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1055~0.base_12| 0)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1055~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1055~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:07:18,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1056~0.offset_10|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1056~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1056~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12|) |v_ULTIMATE.start_main_~#t1056~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1056~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_10|, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1056~0.base] because there is no mapped edge [2019-12-07 13:07:18,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff0_thd1~0_In1762638813 ~z$r_buff1_thd1~0_Out1762638813) (= ~z$r_buff1_thd3~0_Out1762638813 ~z$r_buff0_thd3~0_In1762638813) (= ~z$r_buff0_thd0~0_In1762638813 ~z$r_buff1_thd0~0_Out1762638813) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813)) (= ~z$r_buff1_thd4~0_Out1762638813 ~z$r_buff0_thd4~0_In1762638813) (= ~z$r_buff1_thd2~0_Out1762638813 ~z$r_buff0_thd2~0_In1762638813) (= ~a~0_Out1762638813 1) (= ~b~0_In1762638813 ~__unbuffered_p3_EBX~0_Out1762638813) (= ~a~0_Out1762638813 ~__unbuffered_p3_EAX~0_Out1762638813) (= 1 ~z$r_buff0_thd4~0_Out1762638813)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1762638813, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1762638813, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1762638813, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1762638813, ~a~0=~a~0_Out1762638813, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1762638813, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1762638813, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 13:07:18,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 13:07:18,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:07:18,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1590328055 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1590328055 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1590328055 256))) (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1590328055 256) 0)))) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)) (and (not .cse0) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite9_Out-1590328055|) (= |P2Thread1of1ForFork1_#t~ite8_In-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1590328055|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1590328055|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1590328055|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:07:18,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874553667 256)))) (or (and .cse0 (= ~z$w_buff1~0_In1874553667 |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1874553667 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1874553667 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1874553667 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In1874553667 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| ~z$w_buff1~0_In1874553667) (= |P2Thread1of1ForFork1_#t~ite11_In1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1874553667|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:07:18,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1210292619 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1210292619| |P2Thread1of1ForFork1_#t~ite14_Out1210292619|) (= ~z$w_buff0_used~0_In1210292619 |P2Thread1of1ForFork1_#t~ite15_Out1210292619|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1210292619 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1210292619 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))))) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| |P2Thread1of1ForFork1_#t~ite15_Out1210292619|) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| ~z$w_buff0_used~0_In1210292619) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1210292619|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 13:07:18,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 13:07:18,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-60958231 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-60958231 256)))) (or (= (mod ~z$w_buff0_used~0_In-60958231 256) 0) (and (= (mod ~z$w_buff1_used~0_In-60958231 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-60958231 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| ~z$r_buff1_thd3~0_In-60958231)) (and (= ~z$r_buff1_thd3~0_In-60958231 |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (= |P2Thread1of1ForFork1_#t~ite23_In-60958231| |P2Thread1of1ForFork1_#t~ite23_Out-60958231|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-60958231|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 13:07:18,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:07:18,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1050210907 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1050210907 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1050210907| ~z$w_buff0_used~0_In-1050210907)) (and (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1050210907|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1050210907|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:07:18,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-1401843794 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1401843794 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1401843794 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1401843794 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1401843794 |P3Thread1of1ForFork2_#t~ite29_Out-1401843794|)) (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1401843794| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1401843794|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:07:18,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In815910660 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out815910660 ~z$r_buff0_thd4~0_In815910660)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In815910660 256)))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out815910660 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In815910660} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out815910660, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out815910660|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 13:07:18,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1852831118 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1852831118 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1852831118 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1852831118 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1852831118 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1852831118|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:07:18,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:07:18,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:07:18,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1376465572 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1376465572 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1376465572| |ULTIMATE.start_main_#t~ite36_Out-1376465572|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1376465572| ~z$w_buff1~0_In-1376465572) .cse1 (not .cse2)) (and (= ~z~0_In-1376465572 |ULTIMATE.start_main_#t~ite36_Out-1376465572|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ~z~0=~z~0_In-1376465572} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1376465572|, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1376465572|, ~z~0=~z~0_In-1376465572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:07:18,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-484439986 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-484439986 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-484439986 |ULTIMATE.start_main_#t~ite38_Out-484439986|)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-484439986|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-484439986|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:07:18,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| ~z$w_buff1_used~0_In2096769610) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2096769610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:07:18,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-163914762 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-163914762 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-163914762 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-163914762|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:07:18,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In528227422 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In528227422 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In528227422 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In528227422 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out528227422|)) (and (= ~z$r_buff1_thd0~0_In528227422 |ULTIMATE.start_main_#t~ite41_Out528227422|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out528227422|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:07:18,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:07:18,751 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_75478aff-4772-4601-a017-9d70913d808a/bin/uautomizer/witness.graphml [2019-12-07 13:07:18,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:07:18,752 INFO L168 Benchmark]: Toolchain (without parser) took 16074.92 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 934.0 MB in the beginning and 906.3 MB in the end (delta: 27.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 13:07:18,752 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:07:18,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -117.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:07:18,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:07:18,753 INFO L168 Benchmark]: Boogie Preprocessor took 25.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:07:18,753 INFO L168 Benchmark]: RCFGBuilder took 400.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.3 MB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:07:18,753 INFO L168 Benchmark]: TraceAbstraction took 15178.65 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 936.9 MB). Free memory was 989.3 MB in the beginning and 931.3 MB in the end (delta: 58.1 MB). Peak memory consumption was 995.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:07:18,754 INFO L168 Benchmark]: Witness Printer took 62.14 ms. Allocated memory is still 2.0 GB. Free memory was 931.3 MB in the beginning and 906.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:07:18,755 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -117.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 400.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.3 MB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15178.65 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 936.9 MB). Free memory was 989.3 MB in the beginning and 931.3 MB in the end (delta: 58.1 MB). Peak memory consumption was 995.0 MB. Max. memory is 11.5 GB. * Witness Printer took 62.14 ms. Allocated memory is still 2.0 GB. Free memory was 931.3 MB in the beginning and 906.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1053, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1054, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1055, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1056, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2686 SDtfs, 4428 SDslu, 6648 SDs, 0 SdLazy, 3035 SolverSat, 423 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 26347 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 733 NumberOfCodeBlocks, 733 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 138070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...