./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42b9d704d393a0902d15c9d8c5609ffa231f2e8c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 21:22:55,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:22:55,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:22:55,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:22:55,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:22:55,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:22:55,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:22:55,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:22:55,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:22:55,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:22:55,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:22:55,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:22:55,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:22:55,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:22:55,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:22:55,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:22:55,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:22:55,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:22:55,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:22:56,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:22:56,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:22:56,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:22:56,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:22:56,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:22:56,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:22:56,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:22:56,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:22:56,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:22:56,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:22:56,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:22:56,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:22:56,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:22:56,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:22:56,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:22:56,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:22:56,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:22:56,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:22:56,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:22:56,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:22:56,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:22:56,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:22:56,013 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:22:56,025 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:22:56,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:22:56,026 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:22:56,026 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:22:56,026 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:22:56,026 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:22:56,027 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:22:56,027 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:22:56,027 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:22:56,027 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:22:56,027 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:22:56,027 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:22:56,027 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:22:56,028 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:22:56,028 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:22:56,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:22:56,029 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:22:56,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:22:56,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:22:56,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:22:56,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:22:56,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:22:56,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:22:56,029 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:22:56,030 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:22:56,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:22:56,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:22:56,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:22:56,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:22:56,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:22:56,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:22:56,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:22:56,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:22:56,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:22:56,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:22:56,031 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:22:56,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:22:56,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:22:56,031 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:22:56,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:22:56,031 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan 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 -> Taipan 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 -> 42b9d704d393a0902d15c9d8c5609ffa231f2e8c [2019-12-07 21:22:56,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:22:56,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:22:56,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:22:56,150 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:22:56,151 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:22:56,151 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix002_pso.oepc.i [2019-12-07 21:22:56,188 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/data/3f087a4e2/6edb0df72ad64274b70119fd45881f7e/FLAGe1e4c33f7 [2019-12-07 21:22:56,647 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:22:56,648 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/sv-benchmarks/c/pthread-wmm/mix002_pso.oepc.i [2019-12-07 21:22:56,658 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/data/3f087a4e2/6edb0df72ad64274b70119fd45881f7e/FLAGe1e4c33f7 [2019-12-07 21:22:56,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/data/3f087a4e2/6edb0df72ad64274b70119fd45881f7e [2019-12-07 21:22:56,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:22:56,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:22:56,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:22:56,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:22:56,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:22:56,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:22:56" (1/1) ... [2019-12-07 21:22:56,675 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 09:22:56, skipping insertion in model container [2019-12-07 21:22:56,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:22:56" (1/1) ... [2019-12-07 21:22:56,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:22:56,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:22:56,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:22:56,971 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:22:57,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:22:57,062 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:22:57,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57 WrapperNode [2019-12-07 21:22:57,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:22:57,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:22:57,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:22:57,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:22:57,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... [2019-12-07 21:22:57,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... [2019-12-07 21:22:57,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:22:57,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:22:57,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:22:57,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:22:57,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... [2019-12-07 21:22:57,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... [2019-12-07 21:22:57,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... [2019-12-07 21:22:57,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... [2019-12-07 21:22:57,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... [2019-12-07 21:22:57,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... [2019-12-07 21:22:57,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... [2019-12-07 21:22:57,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:22:57,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:22:57,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:22:57,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:22:57,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/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 21:22:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:22:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:22:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:22:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:22:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:22:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:22:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:22:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:22:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:22:57,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:22:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:22:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:22:57,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:22:57,169 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 21:22:57,532 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:22:57,532 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:22:57,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:22:57 BoogieIcfgContainer [2019-12-07 21:22:57,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:22:57,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:22:57,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:22:57,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:22:57,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:22:56" (1/3) ... [2019-12-07 21:22:57,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71639066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:22:57, skipping insertion in model container [2019-12-07 21:22:57,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:57" (2/3) ... [2019-12-07 21:22:57,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71639066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:22:57, skipping insertion in model container [2019-12-07 21:22:57,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:22:57" (3/3) ... [2019-12-07 21:22:57,538 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_pso.oepc.i [2019-12-07 21:22:57,544 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:22:57,544 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:22:57,549 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:22:57,550 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:22:57,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,583 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,583 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:57,607 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 21:22:57,619 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:22:57,620 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:22:57,620 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:22:57,620 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:22:57,620 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:22:57,620 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:22:57,620 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:22:57,620 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:22:57,631 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-07 21:22:57,632 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 21:22:57,687 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 21:22:57,687 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:22:57,698 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 21:22:57,714 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 21:22:57,747 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 21:22:57,747 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:22:57,752 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 21:22:57,768 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 21:22:57,769 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:23:00,710 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 21:23:00,891 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-07 21:23:00,891 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-07 21:23:00,893 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-07 21:23:15,629 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-07 21:23:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-07 21:23:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 21:23:15,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:15,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 21:23:15,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:15,639 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-07 21:23:15,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:15,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330972793] [2019-12-07 21:23:15,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:15,774 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 21:23:15,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330972793] [2019-12-07 21:23:15,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:15,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:23:15,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749863245] [2019-12-07 21:23:15,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:15,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:15,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:15,790 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-07 21:23:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:16,533 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-07 21:23:16,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:16,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 21:23:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:16,974 INFO L225 Difference]: With dead ends: 119349 [2019-12-07 21:23:16,974 INFO L226 Difference]: Without dead ends: 112420 [2019-12-07 21:23:16,975 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 21:23:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-07 21:23:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-07 21:23:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-07 21:23:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-07 21:23:25,037 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-07 21:23:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:25,038 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-07 21:23:25,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-07 21:23:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:23:25,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:25,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:25,041 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:25,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-07 21:23:25,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:25,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709426208] [2019-12-07 21:23:25,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:25,102 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 21:23:25,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709426208] [2019-12-07 21:23:25,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:25,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:25,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447632460] [2019-12-07 21:23:25,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:25,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:25,104 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-07 21:23:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:26,314 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-07 21:23:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:23:26,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:23:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:26,769 INFO L225 Difference]: With dead ends: 179210 [2019-12-07 21:23:26,769 INFO L226 Difference]: Without dead ends: 179161 [2019-12-07 21:23:26,770 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 21:23:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-07 21:23:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-07 21:23:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-07 21:23:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-07 21:23:37,326 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-07 21:23:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:37,326 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-07 21:23:37,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-07 21:23:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:23:37,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:37,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:37,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:37,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-07 21:23:37,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:37,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239716233] [2019-12-07 21:23:37,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:37,371 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 21:23:37,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239716233] [2019-12-07 21:23:37,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:37,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:37,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829739865] [2019-12-07 21:23:37,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:37,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:37,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:37,372 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-07 21:23:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:37,475 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-07 21:23:37,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:37,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 21:23:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:37,525 INFO L225 Difference]: With dead ends: 34811 [2019-12-07 21:23:37,526 INFO L226 Difference]: Without dead ends: 34811 [2019-12-07 21:23:37,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-07 21:23:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-07 21:23:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-07 21:23:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-07 21:23:38,115 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-07 21:23:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:38,115 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-07 21:23:38,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-07 21:23:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:23:38,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:38,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:38,117 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:38,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-07 21:23:38,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:38,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504588357] [2019-12-07 21:23:38,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:38,170 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 21:23:38,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504588357] [2019-12-07 21:23:38,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:38,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:38,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094092831] [2019-12-07 21:23:38,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:23:38,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:38,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:23:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:38,171 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-07 21:23:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:38,508 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-07 21:23:38,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:23:38,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 21:23:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:38,573 INFO L225 Difference]: With dead ends: 48236 [2019-12-07 21:23:38,573 INFO L226 Difference]: Without dead ends: 48236 [2019-12-07 21:23:38,574 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 21:23:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-07 21:23:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-07 21:23:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-07 21:23:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-07 21:23:39,309 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-07 21:23:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:39,310 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-07 21:23:39,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:23:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-07 21:23:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:23:39,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:39,317 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 21:23:39,317 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:39,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-07 21:23:39,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:39,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367080192] [2019-12-07 21:23:39,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:39,373 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 21:23:39,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367080192] [2019-12-07 21:23:39,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:39,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:23:39,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098026560] [2019-12-07 21:23:39,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:23:39,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:23:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:39,374 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-07 21:23:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:39,927 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-07 21:23:39,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:23:39,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 21:23:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:40,032 INFO L225 Difference]: With dead ends: 62182 [2019-12-07 21:23:40,032 INFO L226 Difference]: Without dead ends: 62175 [2019-12-07 21:23:40,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:23:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-07 21:23:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-07 21:23:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-07 21:23:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-07 21:23:41,177 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-07 21:23:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:41,177 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-07 21:23:41,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:23:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-07 21:23:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 21:23:41,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:41,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:41,187 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:41,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:41,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-07 21:23:41,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:41,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999783792] [2019-12-07 21:23:41,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:41,266 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 21:23:41,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999783792] [2019-12-07 21:23:41,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:41,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:23:41,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140764570] [2019-12-07 21:23:41,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:23:41,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:41,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:23:41,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:41,268 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 6 states. [2019-12-07 21:23:41,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:41,781 INFO L93 Difference]: Finished difference Result 58695 states and 185071 transitions. [2019-12-07 21:23:41,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:23:41,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 21:23:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:41,867 INFO L225 Difference]: With dead ends: 58695 [2019-12-07 21:23:41,867 INFO L226 Difference]: Without dead ends: 58682 [2019-12-07 21:23:41,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:23:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58682 states. [2019-12-07 21:23:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58682 to 48923. [2019-12-07 21:23:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48923 states. [2019-12-07 21:23:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48923 states to 48923 states and 156876 transitions. [2019-12-07 21:23:42,747 INFO L78 Accepts]: Start accepts. Automaton has 48923 states and 156876 transitions. Word has length 25 [2019-12-07 21:23:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:42,747 INFO L462 AbstractCegarLoop]: Abstraction has 48923 states and 156876 transitions. [2019-12-07 21:23:42,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:23:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 48923 states and 156876 transitions. [2019-12-07 21:23:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 21:23:42,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:42,759 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:42,759 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-07 21:23:42,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:42,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663442073] [2019-12-07 21:23:42,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:42,783 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 21:23:42,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663442073] [2019-12-07 21:23:42,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:42,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:42,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460391021] [2019-12-07 21:23:42,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:42,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:42,785 INFO L87 Difference]: Start difference. First operand 48923 states and 156876 transitions. Second operand 3 states. [2019-12-07 21:23:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:42,992 INFO L93 Difference]: Finished difference Result 71146 states and 225062 transitions. [2019-12-07 21:23:42,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:42,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 21:23:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:43,097 INFO L225 Difference]: With dead ends: 71146 [2019-12-07 21:23:43,097 INFO L226 Difference]: Without dead ends: 71146 [2019-12-07 21:23:43,097 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 21:23:43,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71146 states. [2019-12-07 21:23:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71146 to 54361. [2019-12-07 21:23:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54361 states. [2019-12-07 21:23:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54361 states to 54361 states and 172699 transitions. [2019-12-07 21:23:44,229 INFO L78 Accepts]: Start accepts. Automaton has 54361 states and 172699 transitions. Word has length 27 [2019-12-07 21:23:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,229 INFO L462 AbstractCegarLoop]: Abstraction has 54361 states and 172699 transitions. [2019-12-07 21:23:44,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 54361 states and 172699 transitions. [2019-12-07 21:23:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 21:23:44,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,244 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:44,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,245 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-07 21:23:44,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780726008] [2019-12-07 21:23:44,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,287 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 21:23:44,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780726008] [2019-12-07 21:23:44,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:23:44,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050084888] [2019-12-07 21:23:44,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:23:44,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:23:44,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:44,289 INFO L87 Difference]: Start difference. First operand 54361 states and 172699 transitions. Second operand 6 states. [2019-12-07 21:23:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,828 INFO L93 Difference]: Finished difference Result 76093 states and 236920 transitions. [2019-12-07 21:23:44,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:23:44,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 21:23:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,942 INFO L225 Difference]: With dead ends: 76093 [2019-12-07 21:23:44,942 INFO L226 Difference]: Without dead ends: 76051 [2019-12-07 21:23:44,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:23:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76051 states. [2019-12-07 21:23:45,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76051 to 59012. [2019-12-07 21:23:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59012 states. [2019-12-07 21:23:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59012 states to 59012 states and 186959 transitions. [2019-12-07 21:23:46,065 INFO L78 Accepts]: Start accepts. Automaton has 59012 states and 186959 transitions. Word has length 27 [2019-12-07 21:23:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:46,066 INFO L462 AbstractCegarLoop]: Abstraction has 59012 states and 186959 transitions. [2019-12-07 21:23:46,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:23:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 59012 states and 186959 transitions. [2019-12-07 21:23:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 21:23:46,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:46,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:46,083 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1234199411, now seen corresponding path program 1 times [2019-12-07 21:23:46,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:46,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981532413] [2019-12-07 21:23:46,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:46,128 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 21:23:46,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981532413] [2019-12-07 21:23:46,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:46,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:46,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048921768] [2019-12-07 21:23:46,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:23:46,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:46,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:23:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:46,130 INFO L87 Difference]: Start difference. First operand 59012 states and 186959 transitions. Second operand 5 states. [2019-12-07 21:23:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:46,670 INFO L93 Difference]: Finished difference Result 78852 states and 247881 transitions. [2019-12-07 21:23:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:23:46,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 21:23:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:46,785 INFO L225 Difference]: With dead ends: 78852 [2019-12-07 21:23:46,785 INFO L226 Difference]: Without dead ends: 78852 [2019-12-07 21:23:46,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78852 states. [2019-12-07 21:23:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78852 to 69829. [2019-12-07 21:23:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69829 states. [2019-12-07 21:23:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69829 states to 69829 states and 221317 transitions. [2019-12-07 21:23:48,058 INFO L78 Accepts]: Start accepts. Automaton has 69829 states and 221317 transitions. Word has length 28 [2019-12-07 21:23:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:48,058 INFO L462 AbstractCegarLoop]: Abstraction has 69829 states and 221317 transitions. [2019-12-07 21:23:48,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:23:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 69829 states and 221317 transitions. [2019-12-07 21:23:48,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 21:23:48,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:48,082 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] [2019-12-07 21:23:48,082 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:48,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:48,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1195565268, now seen corresponding path program 1 times [2019-12-07 21:23:48,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:48,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198013618] [2019-12-07 21:23:48,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:48,115 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 21:23:48,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198013618] [2019-12-07 21:23:48,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:48,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:23:48,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74733773] [2019-12-07 21:23:48,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:48,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:48,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:48,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:48,116 INFO L87 Difference]: Start difference. First operand 69829 states and 221317 transitions. Second operand 3 states. [2019-12-07 21:23:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:48,308 INFO L93 Difference]: Finished difference Result 69772 states and 221147 transitions. [2019-12-07 21:23:48,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:48,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 21:23:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:48,411 INFO L225 Difference]: With dead ends: 69772 [2019-12-07 21:23:48,412 INFO L226 Difference]: Without dead ends: 69772 [2019-12-07 21:23:48,412 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 21:23:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69772 states. [2019-12-07 21:23:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69772 to 69772. [2019-12-07 21:23:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69772 states. [2019-12-07 21:23:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69772 states to 69772 states and 221147 transitions. [2019-12-07 21:23:49,534 INFO L78 Accepts]: Start accepts. Automaton has 69772 states and 221147 transitions. Word has length 29 [2019-12-07 21:23:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:49,534 INFO L462 AbstractCegarLoop]: Abstraction has 69772 states and 221147 transitions. [2019-12-07 21:23:49,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 69772 states and 221147 transitions. [2019-12-07 21:23:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 21:23:49,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:49,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] [2019-12-07 21:23:49,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:49,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash -803985333, now seen corresponding path program 1 times [2019-12-07 21:23:49,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:49,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813536609] [2019-12-07 21:23:49,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:49,609 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 21:23:49,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813536609] [2019-12-07 21:23:49,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:49,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:49,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667482916] [2019-12-07 21:23:49,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:49,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:49,610 INFO L87 Difference]: Start difference. First operand 69772 states and 221147 transitions. Second operand 4 states. [2019-12-07 21:23:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:49,814 INFO L93 Difference]: Finished difference Result 69773 states and 221000 transitions. [2019-12-07 21:23:49,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:49,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 21:23:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:49,918 INFO L225 Difference]: With dead ends: 69773 [2019-12-07 21:23:49,919 INFO L226 Difference]: Without dead ends: 69773 [2019-12-07 21:23:49,919 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 21:23:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69773 states. [2019-12-07 21:23:50,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69773 to 69677. [2019-12-07 21:23:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69677 states. [2019-12-07 21:23:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69677 states to 69677 states and 220849 transitions. [2019-12-07 21:23:51,215 INFO L78 Accepts]: Start accepts. Automaton has 69677 states and 220849 transitions. Word has length 30 [2019-12-07 21:23:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:51,215 INFO L462 AbstractCegarLoop]: Abstraction has 69677 states and 220849 transitions. [2019-12-07 21:23:51,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 69677 states and 220849 transitions. [2019-12-07 21:23:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 21:23:51,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:51,234 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] [2019-12-07 21:23:51,234 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:51,235 INFO L82 PathProgramCache]: Analyzing trace with hash 885592501, now seen corresponding path program 1 times [2019-12-07 21:23:51,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:51,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759918404] [2019-12-07 21:23:51,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:51,277 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 21:23:51,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759918404] [2019-12-07 21:23:51,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:51,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:51,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776228100] [2019-12-07 21:23:51,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:23:51,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:23:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:51,279 INFO L87 Difference]: Start difference. First operand 69677 states and 220849 transitions. Second operand 5 states. [2019-12-07 21:23:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:51,860 INFO L93 Difference]: Finished difference Result 94132 states and 295464 transitions. [2019-12-07 21:23:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:23:51,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 21:23:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:52,004 INFO L225 Difference]: With dead ends: 94132 [2019-12-07 21:23:52,004 INFO L226 Difference]: Without dead ends: 94125 [2019-12-07 21:23:52,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94125 states. [2019-12-07 21:23:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94125 to 75714. [2019-12-07 21:23:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75714 states. [2019-12-07 21:23:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75714 states to 75714 states and 240444 transitions. [2019-12-07 21:23:53,397 INFO L78 Accepts]: Start accepts. Automaton has 75714 states and 240444 transitions. Word has length 30 [2019-12-07 21:23:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:53,397 INFO L462 AbstractCegarLoop]: Abstraction has 75714 states and 240444 transitions. [2019-12-07 21:23:53,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:23:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 75714 states and 240444 transitions. [2019-12-07 21:23:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 21:23:53,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:53,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:53,430 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:53,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash 479362539, now seen corresponding path program 1 times [2019-12-07 21:23:53,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:53,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261716178] [2019-12-07 21:23:53,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:53,460 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 21:23:53,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261716178] [2019-12-07 21:23:53,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:53,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:53,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762998587] [2019-12-07 21:23:53,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:53,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:53,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:53,461 INFO L87 Difference]: Start difference. First operand 75714 states and 240444 transitions. Second operand 4 states. [2019-12-07 21:23:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:53,559 INFO L93 Difference]: Finished difference Result 33719 states and 101171 transitions. [2019-12-07 21:23:53,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:53,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 21:23:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:53,601 INFO L225 Difference]: With dead ends: 33719 [2019-12-07 21:23:53,601 INFO L226 Difference]: Without dead ends: 33719 [2019-12-07 21:23:53,602 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 21:23:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33719 states. [2019-12-07 21:23:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33719 to 30698. [2019-12-07 21:23:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30698 states. [2019-12-07 21:23:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30698 states to 30698 states and 92320 transitions. [2019-12-07 21:23:54,065 INFO L78 Accepts]: Start accepts. Automaton has 30698 states and 92320 transitions. Word has length 31 [2019-12-07 21:23:54,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:54,065 INFO L462 AbstractCegarLoop]: Abstraction has 30698 states and 92320 transitions. [2019-12-07 21:23:54,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30698 states and 92320 transitions. [2019-12-07 21:23:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:23:54,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:54,085 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 21:23:54,085 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-07 21:23:54,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:54,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379601688] [2019-12-07 21:23:54,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:54,136 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 21:23:54,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379601688] [2019-12-07 21:23:54,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:54,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:54,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182677885] [2019-12-07 21:23:54,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:54,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:54,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:54,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:54,137 INFO L87 Difference]: Start difference. First operand 30698 states and 92320 transitions. Second operand 7 states. [2019-12-07 21:23:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:54,863 INFO L93 Difference]: Finished difference Result 42972 states and 126384 transitions. [2019-12-07 21:23:54,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 21:23:54,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 21:23:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:54,910 INFO L225 Difference]: With dead ends: 42972 [2019-12-07 21:23:54,910 INFO L226 Difference]: Without dead ends: 42972 [2019-12-07 21:23:54,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 21:23:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42972 states. [2019-12-07 21:23:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42972 to 30657. [2019-12-07 21:23:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30657 states. [2019-12-07 21:23:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30657 states to 30657 states and 92330 transitions. [2019-12-07 21:23:55,431 INFO L78 Accepts]: Start accepts. Automaton has 30657 states and 92330 transitions. Word has length 33 [2019-12-07 21:23:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:55,431 INFO L462 AbstractCegarLoop]: Abstraction has 30657 states and 92330 transitions. [2019-12-07 21:23:55,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 30657 states and 92330 transitions. [2019-12-07 21:23:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 21:23:55,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:55,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:55,458 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:55,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:55,459 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-07 21:23:55,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:55,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298792801] [2019-12-07 21:23:55,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:55,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298792801] [2019-12-07 21:23:55,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:55,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:55,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963861697] [2019-12-07 21:23:55,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:55,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:55,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:55,515 INFO L87 Difference]: Start difference. First operand 30657 states and 92330 transitions. Second operand 3 states. [2019-12-07 21:23:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:55,599 INFO L93 Difference]: Finished difference Result 30571 states and 92064 transitions. [2019-12-07 21:23:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:55,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 21:23:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:55,685 INFO L225 Difference]: With dead ends: 30571 [2019-12-07 21:23:55,685 INFO L226 Difference]: Without dead ends: 30571 [2019-12-07 21:23:55,685 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 21:23:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30571 states. [2019-12-07 21:23:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30571 to 25631. [2019-12-07 21:23:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25631 states. [2019-12-07 21:23:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25631 states to 25631 states and 78093 transitions. [2019-12-07 21:23:56,082 INFO L78 Accepts]: Start accepts. Automaton has 25631 states and 78093 transitions. Word has length 40 [2019-12-07 21:23:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:56,082 INFO L462 AbstractCegarLoop]: Abstraction has 25631 states and 78093 transitions. [2019-12-07 21:23:56,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 25631 states and 78093 transitions. [2019-12-07 21:23:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 21:23:56,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:56,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:56,106 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-07 21:23:56,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:56,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148983741] [2019-12-07 21:23:56,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:56,146 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 21:23:56,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148983741] [2019-12-07 21:23:56,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:56,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:23:56,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369158368] [2019-12-07 21:23:56,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:23:56,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:23:56,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:56,148 INFO L87 Difference]: Start difference. First operand 25631 states and 78093 transitions. Second operand 5 states. [2019-12-07 21:23:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:56,228 INFO L93 Difference]: Finished difference Result 24055 states and 74614 transitions. [2019-12-07 21:23:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:23:56,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 21:23:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:56,259 INFO L225 Difference]: With dead ends: 24055 [2019-12-07 21:23:56,259 INFO L226 Difference]: Without dead ends: 24055 [2019-12-07 21:23:56,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24055 states. [2019-12-07 21:23:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24055 to 22227. [2019-12-07 21:23:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22227 states. [2019-12-07 21:23:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22227 states to 22227 states and 69202 transitions. [2019-12-07 21:23:56,586 INFO L78 Accepts]: Start accepts. Automaton has 22227 states and 69202 transitions. Word has length 41 [2019-12-07 21:23:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:56,586 INFO L462 AbstractCegarLoop]: Abstraction has 22227 states and 69202 transitions. [2019-12-07 21:23:56,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:23:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 22227 states and 69202 transitions. [2019-12-07 21:23:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:23:56,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:56,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:56,605 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-07 21:23:56,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:56,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948817326] [2019-12-07 21:23:56,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:56,633 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 21:23:56,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948817326] [2019-12-07 21:23:56,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:56,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:56,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615269304] [2019-12-07 21:23:56,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:56,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:56,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:56,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:56,635 INFO L87 Difference]: Start difference. First operand 22227 states and 69202 transitions. Second operand 3 states. [2019-12-07 21:23:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:56,720 INFO L93 Difference]: Finished difference Result 27893 states and 85226 transitions. [2019-12-07 21:23:56,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:56,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 21:23:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:56,753 INFO L225 Difference]: With dead ends: 27893 [2019-12-07 21:23:56,754 INFO L226 Difference]: Without dead ends: 27893 [2019-12-07 21:23:56,754 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 21:23:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27893 states. [2019-12-07 21:23:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27893 to 21867. [2019-12-07 21:23:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21867 states. [2019-12-07 21:23:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21867 states to 21867 states and 66969 transitions. [2019-12-07 21:23:57,110 INFO L78 Accepts]: Start accepts. Automaton has 21867 states and 66969 transitions. Word has length 65 [2019-12-07 21:23:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:57,110 INFO L462 AbstractCegarLoop]: Abstraction has 21867 states and 66969 transitions. [2019-12-07 21:23:57,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 21867 states and 66969 transitions. [2019-12-07 21:23:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:23:57,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:57,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:57,129 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-07 21:23:57,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:57,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246244009] [2019-12-07 21:23:57,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:57,175 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 21:23:57,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246244009] [2019-12-07 21:23:57,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:57,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:57,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757573228] [2019-12-07 21:23:57,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:57,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:57,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:57,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:57,177 INFO L87 Difference]: Start difference. First operand 21867 states and 66969 transitions. Second operand 3 states. [2019-12-07 21:23:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:57,279 INFO L93 Difference]: Finished difference Result 25548 states and 78442 transitions. [2019-12-07 21:23:57,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:57,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 21:23:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:57,310 INFO L225 Difference]: With dead ends: 25548 [2019-12-07 21:23:57,310 INFO L226 Difference]: Without dead ends: 25548 [2019-12-07 21:23:57,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:23:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25548 states. [2019-12-07 21:23:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25548 to 20665. [2019-12-07 21:23:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20665 states. [2019-12-07 21:23:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20665 states to 20665 states and 63858 transitions. [2019-12-07 21:23:57,632 INFO L78 Accepts]: Start accepts. Automaton has 20665 states and 63858 transitions. Word has length 65 [2019-12-07 21:23:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:57,632 INFO L462 AbstractCegarLoop]: Abstraction has 20665 states and 63858 transitions. [2019-12-07 21:23:57,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20665 states and 63858 transitions. [2019-12-07 21:23:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:23:57,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:57,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:57,652 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:57,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:57,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1193255729, now seen corresponding path program 1 times [2019-12-07 21:23:57,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:57,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263622940] [2019-12-07 21:23:57,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:57,720 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 21:23:57,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263622940] [2019-12-07 21:23:57,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:57,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:23:57,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070910741] [2019-12-07 21:23:57,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:23:57,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:57,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:23:57,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:23:57,722 INFO L87 Difference]: Start difference. First operand 20665 states and 63858 transitions. Second operand 8 states. [2019-12-07 21:23:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:58,692 INFO L93 Difference]: Finished difference Result 37239 states and 113655 transitions. [2019-12-07 21:23:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 21:23:58,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 21:23:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:58,733 INFO L225 Difference]: With dead ends: 37239 [2019-12-07 21:23:58,733 INFO L226 Difference]: Without dead ends: 37239 [2019-12-07 21:23:58,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:23:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37239 states. [2019-12-07 21:23:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37239 to 19717. [2019-12-07 21:23:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19717 states. [2019-12-07 21:23:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19717 states to 19717 states and 61012 transitions. [2019-12-07 21:23:59,140 INFO L78 Accepts]: Start accepts. Automaton has 19717 states and 61012 transitions. Word has length 66 [2019-12-07 21:23:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:59,141 INFO L462 AbstractCegarLoop]: Abstraction has 19717 states and 61012 transitions. [2019-12-07 21:23:59,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:23:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 19717 states and 61012 transitions. [2019-12-07 21:23:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:23:59,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:59,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:59,159 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:59,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:59,159 INFO L82 PathProgramCache]: Analyzing trace with hash -467753823, now seen corresponding path program 1 times [2019-12-07 21:23:59,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:59,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717820938] [2019-12-07 21:23:59,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:59,197 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 21:23:59,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717820938] [2019-12-07 21:23:59,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:59,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:59,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388763259] [2019-12-07 21:23:59,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:59,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:59,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:59,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:59,198 INFO L87 Difference]: Start difference. First operand 19717 states and 61012 transitions. Second operand 4 states. [2019-12-07 21:23:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:59,282 INFO L93 Difference]: Finished difference Result 19494 states and 60084 transitions. [2019-12-07 21:23:59,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:59,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 21:23:59,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:59,303 INFO L225 Difference]: With dead ends: 19494 [2019-12-07 21:23:59,303 INFO L226 Difference]: Without dead ends: 19494 [2019-12-07 21:23:59,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 21:23:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19494 states. [2019-12-07 21:23:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19494 to 17313. [2019-12-07 21:23:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17313 states. [2019-12-07 21:23:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17313 states to 17313 states and 53288 transitions. [2019-12-07 21:23:59,565 INFO L78 Accepts]: Start accepts. Automaton has 17313 states and 53288 transitions. Word has length 66 [2019-12-07 21:23:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:59,565 INFO L462 AbstractCegarLoop]: Abstraction has 17313 states and 53288 transitions. [2019-12-07 21:23:59,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 17313 states and 53288 transitions. [2019-12-07 21:23:59,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:23:59,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:59,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:59,580 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:59,580 INFO L82 PathProgramCache]: Analyzing trace with hash -612810128, now seen corresponding path program 1 times [2019-12-07 21:23:59,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:59,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511505406] [2019-12-07 21:23:59,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:59,630 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 21:23:59,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511505406] [2019-12-07 21:23:59,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:59,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:23:59,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726629541] [2019-12-07 21:23:59,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:59,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:59,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:59,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:59,631 INFO L87 Difference]: Start difference. First operand 17313 states and 53288 transitions. Second operand 7 states. [2019-12-07 21:23:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:59,909 INFO L93 Difference]: Finished difference Result 47852 states and 145045 transitions. [2019-12-07 21:23:59,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:23:59,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 21:23:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:59,949 INFO L225 Difference]: With dead ends: 47852 [2019-12-07 21:23:59,949 INFO L226 Difference]: Without dead ends: 36381 [2019-12-07 21:23:59,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:24:00,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36381 states. [2019-12-07 21:24:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36381 to 20970. [2019-12-07 21:24:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20970 states. [2019-12-07 21:24:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20970 states to 20970 states and 64404 transitions. [2019-12-07 21:24:00,378 INFO L78 Accepts]: Start accepts. Automaton has 20970 states and 64404 transitions. Word has length 66 [2019-12-07 21:24:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:00,378 INFO L462 AbstractCegarLoop]: Abstraction has 20970 states and 64404 transitions. [2019-12-07 21:24:00,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:24:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 20970 states and 64404 transitions. [2019-12-07 21:24:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:24:00,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:00,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:00,397 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2118112598, now seen corresponding path program 2 times [2019-12-07 21:24:00,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:00,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952334843] [2019-12-07 21:24:00,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:00,433 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 21:24:00,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952334843] [2019-12-07 21:24:00,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:00,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:24:00,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717496342] [2019-12-07 21:24:00,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:24:00,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:00,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:24:00,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:24:00,434 INFO L87 Difference]: Start difference. First operand 20970 states and 64404 transitions. Second operand 3 states. [2019-12-07 21:24:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:00,491 INFO L93 Difference]: Finished difference Result 16643 states and 50304 transitions. [2019-12-07 21:24:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:24:00,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 21:24:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:00,510 INFO L225 Difference]: With dead ends: 16643 [2019-12-07 21:24:00,510 INFO L226 Difference]: Without dead ends: 16643 [2019-12-07 21:24:00,510 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 21:24:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16643 states. [2019-12-07 21:24:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16643 to 14789. [2019-12-07 21:24:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14789 states. [2019-12-07 21:24:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14789 states to 14789 states and 44680 transitions. [2019-12-07 21:24:00,742 INFO L78 Accepts]: Start accepts. Automaton has 14789 states and 44680 transitions. Word has length 66 [2019-12-07 21:24:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:00,743 INFO L462 AbstractCegarLoop]: Abstraction has 14789 states and 44680 transitions. [2019-12-07 21:24:00,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:24:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 14789 states and 44680 transitions. [2019-12-07 21:24:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:24:00,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:00,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:00,756 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:00,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-07 21:24:00,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:00,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879701441] [2019-12-07 21:24:00,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:00,862 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 21:24:00,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879701441] [2019-12-07 21:24:00,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:00,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:24:00,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623194508] [2019-12-07 21:24:00,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:24:00,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:24:00,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:24:00,863 INFO L87 Difference]: Start difference. First operand 14789 states and 44680 transitions. Second operand 10 states. [2019-12-07 21:24:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:01,969 INFO L93 Difference]: Finished difference Result 31774 states and 95619 transitions. [2019-12-07 21:24:01,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 21:24:01,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 21:24:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:01,993 INFO L225 Difference]: With dead ends: 31774 [2019-12-07 21:24:01,993 INFO L226 Difference]: Without dead ends: 22821 [2019-12-07 21:24:01,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-07 21:24:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22821 states. [2019-12-07 21:24:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22821 to 17355. [2019-12-07 21:24:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17355 states. [2019-12-07 21:24:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17355 states to 17355 states and 52136 transitions. [2019-12-07 21:24:02,276 INFO L78 Accepts]: Start accepts. Automaton has 17355 states and 52136 transitions. Word has length 67 [2019-12-07 21:24:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:02,276 INFO L462 AbstractCegarLoop]: Abstraction has 17355 states and 52136 transitions. [2019-12-07 21:24:02,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:24:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 17355 states and 52136 transitions. [2019-12-07 21:24:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:24:02,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:02,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:02,291 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1732898859, now seen corresponding path program 2 times [2019-12-07 21:24:02,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:02,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489572971] [2019-12-07 21:24:02,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:02,624 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 21:24:02,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489572971] [2019-12-07 21:24:02,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:02,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 21:24:02,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309456756] [2019-12-07 21:24:02,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 21:24:02,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:02,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 21:24:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:24:02,625 INFO L87 Difference]: Start difference. First operand 17355 states and 52136 transitions. Second operand 15 states. [2019-12-07 21:24:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:03,745 INFO L93 Difference]: Finished difference Result 20054 states and 59259 transitions. [2019-12-07 21:24:03,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 21:24:03,745 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 21:24:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:03,771 INFO L225 Difference]: With dead ends: 20054 [2019-12-07 21:24:03,771 INFO L226 Difference]: Without dead ends: 17390 [2019-12-07 21:24:03,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-12-07 21:24:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17390 states. [2019-12-07 21:24:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17390 to 16367. [2019-12-07 21:24:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16367 states. [2019-12-07 21:24:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16367 states to 16367 states and 48962 transitions. [2019-12-07 21:24:04,009 INFO L78 Accepts]: Start accepts. Automaton has 16367 states and 48962 transitions. Word has length 67 [2019-12-07 21:24:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:04,009 INFO L462 AbstractCegarLoop]: Abstraction has 16367 states and 48962 transitions. [2019-12-07 21:24:04,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 21:24:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 16367 states and 48962 transitions. [2019-12-07 21:24:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:24:04,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:04,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:04,023 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1181689129, now seen corresponding path program 3 times [2019-12-07 21:24:04,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:04,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528694799] [2019-12-07 21:24:04,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:04,132 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 21:24:04,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528694799] [2019-12-07 21:24:04,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:04,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:24:04,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253573603] [2019-12-07 21:24:04,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:24:04,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:24:04,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:24:04,134 INFO L87 Difference]: Start difference. First operand 16367 states and 48962 transitions. Second operand 10 states. [2019-12-07 21:24:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:05,130 INFO L93 Difference]: Finished difference Result 26672 states and 79036 transitions. [2019-12-07 21:24:05,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 21:24:05,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 21:24:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:05,156 INFO L225 Difference]: With dead ends: 26672 [2019-12-07 21:24:05,156 INFO L226 Difference]: Without dead ends: 23169 [2019-12-07 21:24:05,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-07 21:24:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23169 states. [2019-12-07 21:24:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23169 to 16745. [2019-12-07 21:24:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16745 states. [2019-12-07 21:24:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16745 states to 16745 states and 49896 transitions. [2019-12-07 21:24:05,434 INFO L78 Accepts]: Start accepts. Automaton has 16745 states and 49896 transitions. Word has length 67 [2019-12-07 21:24:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:05,434 INFO L462 AbstractCegarLoop]: Abstraction has 16745 states and 49896 transitions. [2019-12-07 21:24:05,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:24:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 16745 states and 49896 transitions. [2019-12-07 21:24:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:24:05,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:05,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:05,449 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1111610073, now seen corresponding path program 4 times [2019-12-07 21:24:05,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:05,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926695920] [2019-12-07 21:24:05,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:05,573 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 21:24:05,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926695920] [2019-12-07 21:24:05,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:05,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:24:05,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031975124] [2019-12-07 21:24:05,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:24:05,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:05,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:24:05,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:24:05,574 INFO L87 Difference]: Start difference. First operand 16745 states and 49896 transitions. Second operand 11 states. [2019-12-07 21:24:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:06,580 INFO L93 Difference]: Finished difference Result 25309 states and 75027 transitions. [2019-12-07 21:24:06,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 21:24:06,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 21:24:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:06,615 INFO L225 Difference]: With dead ends: 25309 [2019-12-07 21:24:06,615 INFO L226 Difference]: Without dead ends: 22360 [2019-12-07 21:24:06,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:24:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22360 states. [2019-12-07 21:24:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22360 to 16345. [2019-12-07 21:24:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16345 states. [2019-12-07 21:24:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16345 states to 16345 states and 48740 transitions. [2019-12-07 21:24:06,888 INFO L78 Accepts]: Start accepts. Automaton has 16345 states and 48740 transitions. Word has length 67 [2019-12-07 21:24:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:06,888 INFO L462 AbstractCegarLoop]: Abstraction has 16345 states and 48740 transitions. [2019-12-07 21:24:06,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:24:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 16345 states and 48740 transitions. [2019-12-07 21:24:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:24:06,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:06,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:06,902 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 5 times [2019-12-07 21:24:06,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:06,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964648399] [2019-12-07 21:24:06,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:07,023 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 21:24:07,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964648399] [2019-12-07 21:24:07,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:07,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:24:07,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822522707] [2019-12-07 21:24:07,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:24:07,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:07,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:24:07,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:24:07,024 INFO L87 Difference]: Start difference. First operand 16345 states and 48740 transitions. Second operand 11 states. [2019-12-07 21:24:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:07,995 INFO L93 Difference]: Finished difference Result 23659 states and 70157 transitions. [2019-12-07 21:24:07,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 21:24:07,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 21:24:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:08,014 INFO L225 Difference]: With dead ends: 23659 [2019-12-07 21:24:08,015 INFO L226 Difference]: Without dead ends: 22104 [2019-12-07 21:24:08,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-07 21:24:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-07 21:24:08,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 16417. [2019-12-07 21:24:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16417 states. [2019-12-07 21:24:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16417 states to 16417 states and 48909 transitions. [2019-12-07 21:24:08,273 INFO L78 Accepts]: Start accepts. Automaton has 16417 states and 48909 transitions. Word has length 67 [2019-12-07 21:24:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:08,273 INFO L462 AbstractCegarLoop]: Abstraction has 16417 states and 48909 transitions. [2019-12-07 21:24:08,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:24:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 16417 states and 48909 transitions. [2019-12-07 21:24:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:24:08,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:08,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:08,286 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:08,287 INFO L82 PathProgramCache]: Analyzing trace with hash -809344243, now seen corresponding path program 6 times [2019-12-07 21:24:08,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:08,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545061483] [2019-12-07 21:24:08,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:08,401 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 21:24:08,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545061483] [2019-12-07 21:24:08,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:08,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:24:08,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153373171] [2019-12-07 21:24:08,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:24:08,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:08,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:24:08,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:24:08,402 INFO L87 Difference]: Start difference. First operand 16417 states and 48909 transitions. Second operand 11 states. [2019-12-07 21:24:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:09,115 INFO L93 Difference]: Finished difference Result 40058 states and 119457 transitions. [2019-12-07 21:24:09,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 21:24:09,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 21:24:09,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:09,156 INFO L225 Difference]: With dead ends: 40058 [2019-12-07 21:24:09,156 INFO L226 Difference]: Without dead ends: 35231 [2019-12-07 21:24:09,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 21:24:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35231 states. [2019-12-07 21:24:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35231 to 20611. [2019-12-07 21:24:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20611 states. [2019-12-07 21:24:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20611 states to 20611 states and 61875 transitions. [2019-12-07 21:24:09,564 INFO L78 Accepts]: Start accepts. Automaton has 20611 states and 61875 transitions. Word has length 67 [2019-12-07 21:24:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:09,564 INFO L462 AbstractCegarLoop]: Abstraction has 20611 states and 61875 transitions. [2019-12-07 21:24:09,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:24:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 20611 states and 61875 transitions. [2019-12-07 21:24:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:24:09,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:09,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:09,581 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash -900170963, now seen corresponding path program 7 times [2019-12-07 21:24:09,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:09,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039694367] [2019-12-07 21:24:09,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:09,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039694367] [2019-12-07 21:24:09,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:09,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 21:24:09,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920162494] [2019-12-07 21:24:09,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 21:24:09,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:09,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 21:24:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:24:09,741 INFO L87 Difference]: Start difference. First operand 20611 states and 61875 transitions. Second operand 13 states. [2019-12-07 21:24:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:10,677 INFO L93 Difference]: Finished difference Result 26942 states and 79526 transitions. [2019-12-07 21:24:10,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 21:24:10,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-07 21:24:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:10,710 INFO L225 Difference]: With dead ends: 26942 [2019-12-07 21:24:10,710 INFO L226 Difference]: Without dead ends: 22425 [2019-12-07 21:24:10,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2019-12-07 21:24:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22425 states. [2019-12-07 21:24:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22425 to 20058. [2019-12-07 21:24:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20058 states. [2019-12-07 21:24:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20058 states to 20058 states and 59976 transitions. [2019-12-07 21:24:11,013 INFO L78 Accepts]: Start accepts. Automaton has 20058 states and 59976 transitions. Word has length 67 [2019-12-07 21:24:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:11,013 INFO L462 AbstractCegarLoop]: Abstraction has 20058 states and 59976 transitions. [2019-12-07 21:24:11,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 21:24:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 20058 states and 59976 transitions. [2019-12-07 21:24:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:24:11,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:11,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:11,030 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:11,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 8 times [2019-12-07 21:24:11,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:11,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877923371] [2019-12-07 21:24:11,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:11,245 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 21:24:11,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877923371] [2019-12-07 21:24:11,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:11,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 21:24:11,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555061430] [2019-12-07 21:24:11,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 21:24:11,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 21:24:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:24:11,247 INFO L87 Difference]: Start difference. First operand 20058 states and 59976 transitions. Second operand 14 states. [2019-12-07 21:24:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:13,481 INFO L93 Difference]: Finished difference Result 34188 states and 99557 transitions. [2019-12-07 21:24:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 21:24:13,482 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-07 21:24:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:13,515 INFO L225 Difference]: With dead ends: 34188 [2019-12-07 21:24:13,515 INFO L226 Difference]: Without dead ends: 31989 [2019-12-07 21:24:13,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 21:24:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31989 states. [2019-12-07 21:24:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31989 to 19966. [2019-12-07 21:24:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19966 states. [2019-12-07 21:24:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19966 states to 19966 states and 59585 transitions. [2019-12-07 21:24:13,880 INFO L78 Accepts]: Start accepts. Automaton has 19966 states and 59585 transitions. Word has length 67 [2019-12-07 21:24:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:13,880 INFO L462 AbstractCegarLoop]: Abstraction has 19966 states and 59585 transitions. [2019-12-07 21:24:13,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 21:24:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19966 states and 59585 transitions. [2019-12-07 21:24:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 21:24:13,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:13,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:13,897 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:13,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:13,897 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 9 times [2019-12-07 21:24:13,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:13,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119234243] [2019-12-07 21:24:13,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:24:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:24:13,983 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:24:13,983 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:24:13,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23|) |v_ULTIMATE.start_main_~#t44~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t44~0.base_23|) (= 0 |v_ULTIMATE.start_main_~#t44~0.offset_18|) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23|) 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23| 1)) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t44~0.base_23| 4)) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ULTIMATE.start_main_~#t44~0.base=|v_ULTIMATE.start_main_~#t44~0.base_23|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t44~0.offset=|v_ULTIMATE.start_main_~#t44~0.offset_18|, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t46~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t45~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t46~0.offset, ULTIMATE.start_main_~#t45~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t44~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t44~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 21:24:13,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork2_#in~arg.offset_In177328420| P0Thread1of1ForFork2_~arg.offset_Out177328420) (= P0Thread1of1ForFork2_~arg.base_Out177328420 |P0Thread1of1ForFork2_#in~arg.base_In177328420|) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out177328420 0)) (= 1 ~a$w_buff0~0_Out177328420) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out177328420 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out177328420|) (= ~a$w_buff0~0_In177328420 ~a$w_buff1~0_Out177328420) (= 1 ~a$w_buff0_used~0_Out177328420) (= ~a$w_buff0_used~0_In177328420 ~a$w_buff1_used~0_Out177328420) (= (ite (not (and (not (= (mod ~a$w_buff0_used~0_Out177328420 256) 0)) (not (= 0 (mod ~a$w_buff1_used~0_Out177328420 256))))) 1 0) |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out177328420|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In177328420|, ~a$w_buff0~0=~a$w_buff0~0_In177328420, ~a$w_buff0_used~0=~a$w_buff0_used~0_In177328420, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In177328420|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out177328420, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In177328420|, ~a$w_buff0~0=~a$w_buff0~0_Out177328420, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out177328420, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out177328420, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out177328420, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In177328420|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out177328420, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out177328420, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out177328420|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:24:13,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t45~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t45~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t45~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t45~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13|) |v_ULTIMATE.start_main_~#t45~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_13|, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t45~0.base, ULTIMATE.start_main_~#t45~0.offset] because there is no mapped edge [2019-12-07 21:24:13,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite10_Out-1083272070| |P1Thread1of1ForFork0_#t~ite9_Out-1083272070|)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1083272070 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1083272070 256)))) (or (and .cse0 (= ~a~0_In-1083272070 |P1Thread1of1ForFork0_#t~ite9_Out-1083272070|) (or .cse1 .cse2)) (and (= ~a$w_buff1~0_In-1083272070 |P1Thread1of1ForFork0_#t~ite9_Out-1083272070|) .cse0 (not .cse1) (not .cse2)))) InVars {~a~0=~a~0_In-1083272070, ~a$w_buff1~0=~a$w_buff1~0_In-1083272070, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1083272070, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1083272070} OutVars{~a~0=~a~0_In-1083272070, ~a$w_buff1~0=~a$w_buff1~0_In-1083272070, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-1083272070|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1083272070, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1083272070|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1083272070} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 21:24:13,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-2114014848 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-2114014848 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-2114014848| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-2114014848| ~a$w_buff0_used~0_In-2114014848)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2114014848, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2114014848} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2114014848, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-2114014848|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2114014848} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 21:24:13,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1808458810 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1808458810 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1808458810 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In1808458810 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1808458810 |P1Thread1of1ForFork0_#t~ite12_Out1808458810|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out1808458810| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1808458810, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1808458810, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1808458810, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1808458810} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1808458810, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1808458810, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1808458810|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1808458810, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1808458810} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 21:24:13,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-2123560167 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2123560167 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite13_Out-2123560167| 0)) (and (= |P1Thread1of1ForFork0_#t~ite13_Out-2123560167| ~a$r_buff0_thd2~0_In-2123560167) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2123560167, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123560167} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2123560167, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123560167, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-2123560167|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 21:24:13,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1889800423 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1889800423 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1889800423 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1889800423 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-1889800423|)) (and (= ~a$r_buff1_thd2~0_In-1889800423 |P1Thread1of1ForFork0_#t~ite14_Out-1889800423|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1889800423, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1889800423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1889800423, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1889800423} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1889800423, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1889800423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1889800423, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1889800423|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1889800423} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 21:24:13,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_26|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_25|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 21:24:13,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t46~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t46~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12|) |v_ULTIMATE.start_main_~#t46~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t46~0.base_12|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t46~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_12|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t46~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t46~0.offset] because there is no mapped edge [2019-12-07 21:24:13,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In731637025 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite21_Out731637025| ~a$w_buff0~0_In731637025) (= |P2Thread1of1ForFork1_#t~ite20_In731637025| |P2Thread1of1ForFork1_#t~ite20_Out731637025|)) (and .cse0 (= ~a$w_buff0~0_In731637025 |P2Thread1of1ForFork1_#t~ite20_Out731637025|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In731637025 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In731637025 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In731637025 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In731637025 256))))) (= |P2Thread1of1ForFork1_#t~ite21_Out731637025| |P2Thread1of1ForFork1_#t~ite20_Out731637025|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In731637025|, ~a$w_buff0~0=~a$w_buff0~0_In731637025, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In731637025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In731637025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In731637025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In731637025, ~weak$$choice2~0=~weak$$choice2~0_In731637025} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out731637025|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out731637025|, ~a$w_buff0~0=~a$w_buff0~0_In731637025, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In731637025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In731637025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In731637025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In731637025, ~weak$$choice2~0=~weak$$choice2~0_In731637025} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 21:24:13,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-986504956 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-986504956 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-986504956 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In-986504956 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-986504956 256) 0))) (= |P2Thread1of1ForFork1_#t~ite26_Out-986504956| ~a$w_buff0_used~0_In-986504956) (= |P2Thread1of1ForFork1_#t~ite26_Out-986504956| |P2Thread1of1ForFork1_#t~ite27_Out-986504956|)) (and (= |P2Thread1of1ForFork1_#t~ite26_In-986504956| |P2Thread1of1ForFork1_#t~ite26_Out-986504956|) (= |P2Thread1of1ForFork1_#t~ite27_Out-986504956| ~a$w_buff0_used~0_In-986504956) (not .cse0)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-986504956|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-986504956, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-986504956, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-986504956, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-986504956, ~weak$$choice2~0=~weak$$choice2~0_In-986504956} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-986504956|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-986504956|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-986504956, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-986504956, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-986504956, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-986504956, ~weak$$choice2~0=~weak$$choice2~0_In-986504956} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 21:24:13,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 21:24:13,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 21:24:13,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1428107490 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1428107490 256) 0))) (or (and (= ~a~0_In1428107490 |P2Thread1of1ForFork1_#t~ite38_Out1428107490|) (or .cse0 .cse1)) (and (not .cse1) (= ~a$w_buff1~0_In1428107490 |P2Thread1of1ForFork1_#t~ite38_Out1428107490|) (not .cse0)))) InVars {~a~0=~a~0_In1428107490, ~a$w_buff1~0=~a$w_buff1~0_In1428107490, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1428107490, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1428107490} OutVars{~a~0=~a~0_In1428107490, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1428107490|, ~a$w_buff1~0=~a$w_buff1~0_In1428107490, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1428107490, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1428107490} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 21:24:13,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 21:24:13,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In2114761290 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In2114761290 256) 0))) (or (and (= ~a$w_buff0_used~0_In2114761290 |P2Thread1of1ForFork1_#t~ite40_Out2114761290|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out2114761290|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2114761290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2114761290} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2114761290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2114761290, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out2114761290|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 21:24:13,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In2126147209 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In2126147209 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2126147209 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In2126147209 256) 0))) (or (and (= ~a$w_buff1_used~0_In2126147209 |P2Thread1of1ForFork1_#t~ite41_Out2126147209|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out2126147209|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2126147209, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2126147209, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2126147209, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2126147209} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2126147209, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2126147209, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2126147209, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out2126147209|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2126147209} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 21:24:13,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1421356120 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1421356120 256)))) (or (and (= ~a$r_buff0_thd3~0_In-1421356120 |P2Thread1of1ForFork1_#t~ite42_Out-1421356120|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1421356120|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1421356120, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1421356120} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1421356120|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1421356120, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1421356120} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 21:24:13,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1445510027 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1445510027 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1445510027 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In1445510027 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite43_Out1445510027| 0)) (and (= |P2Thread1of1ForFork1_#t~ite43_Out1445510027| ~a$r_buff1_thd3~0_In1445510027) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1445510027, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1445510027, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1445510027, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1445510027} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1445510027|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1445510027, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1445510027, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1445510027, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1445510027} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 21:24:13,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_32|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 21:24:13,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In201306404 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In201306404 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out201306404| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In201306404 |P0Thread1of1ForFork2_#t~ite5_Out201306404|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In201306404, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In201306404} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out201306404|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In201306404, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In201306404} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 21:24:13,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1345775623 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1345775623 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1345775623 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1345775623 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite6_Out-1345775623| ~a$w_buff1_used~0_In-1345775623)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1345775623|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1345775623, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345775623, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1345775623, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345775623} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1345775623, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1345775623|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345775623, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1345775623, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345775623} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 21:24:13,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-909317594 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-909317594 256) 0)) (.cse2 (= ~a$r_buff0_thd1~0_In-909317594 ~a$r_buff0_thd1~0_Out-909317594))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-909317594) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-909317594, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-909317594} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-909317594|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-909317594, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-909317594} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:24:13,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In193267429 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In193267429 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In193267429 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In193267429 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite8_Out193267429| 0)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out193267429| ~a$r_buff1_thd1~0_In193267429) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In193267429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In193267429, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In193267429, ~a$w_buff1_used~0=~a$w_buff1_used~0_In193267429} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out193267429|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In193267429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In193267429, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In193267429, ~a$w_buff1_used~0=~a$w_buff1_used~0_In193267429} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 21:24:13,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_42| v_~a$r_buff1_thd1~0_72) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_41|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 21:24:13,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:24:13,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In2088449369 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In2088449369 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In2088449369 |ULTIMATE.start_main_#t~ite47_Out2088449369|)) (and (= ~a~0_In2088449369 |ULTIMATE.start_main_#t~ite47_Out2088449369|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In2088449369, ~a$w_buff1~0=~a$w_buff1~0_In2088449369, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2088449369, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2088449369} OutVars{~a~0=~a~0_In2088449369, ~a$w_buff1~0=~a$w_buff1~0_In2088449369, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2088449369|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2088449369, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2088449369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 21:24:13,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 21:24:13,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-671787214 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-671787214 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-671787214| ~a$w_buff0_used~0_In-671787214) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-671787214| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-671787214, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-671787214} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-671787214, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-671787214|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-671787214} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 21:24:13,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-221431766 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-221431766 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-221431766 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-221431766 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-221431766 |ULTIMATE.start_main_#t~ite50_Out-221431766|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-221431766| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-221431766, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221431766, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-221431766, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221431766} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-221431766|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-221431766, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221431766, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-221431766, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221431766} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 21:24:13,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-5072653 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-5072653 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-5072653| 0)) (and (= |ULTIMATE.start_main_#t~ite51_Out-5072653| ~a$r_buff0_thd0~0_In-5072653) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-5072653, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-5072653} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-5072653|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-5072653, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-5072653} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 21:24:13,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In-1880966589 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1880966589 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1880966589 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1880966589 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1880966589| ~a$r_buff1_thd0~0_In-1880966589) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-1880966589| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1880966589, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1880966589, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1880966589, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1880966589} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1880966589|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1880966589, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1880966589, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1880966589, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1880966589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 21:24:13,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:24:14,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:24:14 BasicIcfg [2019-12-07 21:24:14,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:24:14,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:24:14,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:24:14,057 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:24:14,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:22:57" (3/4) ... [2019-12-07 21:24:14,059 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:24:14,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23|) |v_ULTIMATE.start_main_~#t44~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t44~0.base_23|) (= 0 |v_ULTIMATE.start_main_~#t44~0.offset_18|) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23|) 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23| 1)) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t44~0.base_23| 4)) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ULTIMATE.start_main_~#t44~0.base=|v_ULTIMATE.start_main_~#t44~0.base_23|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t44~0.offset=|v_ULTIMATE.start_main_~#t44~0.offset_18|, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t46~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t45~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t46~0.offset, ULTIMATE.start_main_~#t45~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t44~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t44~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 21:24:14,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork2_#in~arg.offset_In177328420| P0Thread1of1ForFork2_~arg.offset_Out177328420) (= P0Thread1of1ForFork2_~arg.base_Out177328420 |P0Thread1of1ForFork2_#in~arg.base_In177328420|) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out177328420 0)) (= 1 ~a$w_buff0~0_Out177328420) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out177328420 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out177328420|) (= ~a$w_buff0~0_In177328420 ~a$w_buff1~0_Out177328420) (= 1 ~a$w_buff0_used~0_Out177328420) (= ~a$w_buff0_used~0_In177328420 ~a$w_buff1_used~0_Out177328420) (= (ite (not (and (not (= (mod ~a$w_buff0_used~0_Out177328420 256) 0)) (not (= 0 (mod ~a$w_buff1_used~0_Out177328420 256))))) 1 0) |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out177328420|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In177328420|, ~a$w_buff0~0=~a$w_buff0~0_In177328420, ~a$w_buff0_used~0=~a$w_buff0_used~0_In177328420, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In177328420|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out177328420, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In177328420|, ~a$w_buff0~0=~a$w_buff0~0_Out177328420, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out177328420, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out177328420, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out177328420, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In177328420|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out177328420, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out177328420, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out177328420|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:24:14,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t45~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t45~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t45~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t45~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13|) |v_ULTIMATE.start_main_~#t45~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_13|, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t45~0.base, ULTIMATE.start_main_~#t45~0.offset] because there is no mapped edge [2019-12-07 21:24:14,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite10_Out-1083272070| |P1Thread1of1ForFork0_#t~ite9_Out-1083272070|)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1083272070 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1083272070 256)))) (or (and .cse0 (= ~a~0_In-1083272070 |P1Thread1of1ForFork0_#t~ite9_Out-1083272070|) (or .cse1 .cse2)) (and (= ~a$w_buff1~0_In-1083272070 |P1Thread1of1ForFork0_#t~ite9_Out-1083272070|) .cse0 (not .cse1) (not .cse2)))) InVars {~a~0=~a~0_In-1083272070, ~a$w_buff1~0=~a$w_buff1~0_In-1083272070, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1083272070, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1083272070} OutVars{~a~0=~a~0_In-1083272070, ~a$w_buff1~0=~a$w_buff1~0_In-1083272070, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-1083272070|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1083272070, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1083272070|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1083272070} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 21:24:14,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-2114014848 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-2114014848 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-2114014848| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-2114014848| ~a$w_buff0_used~0_In-2114014848)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2114014848, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2114014848} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2114014848, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-2114014848|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2114014848} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 21:24:14,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1808458810 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1808458810 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1808458810 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In1808458810 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1808458810 |P1Thread1of1ForFork0_#t~ite12_Out1808458810|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out1808458810| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1808458810, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1808458810, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1808458810, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1808458810} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1808458810, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1808458810, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1808458810|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1808458810, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1808458810} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 21:24:14,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-2123560167 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2123560167 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite13_Out-2123560167| 0)) (and (= |P1Thread1of1ForFork0_#t~ite13_Out-2123560167| ~a$r_buff0_thd2~0_In-2123560167) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2123560167, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123560167} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2123560167, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123560167, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-2123560167|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 21:24:14,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1889800423 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1889800423 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1889800423 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1889800423 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-1889800423|)) (and (= ~a$r_buff1_thd2~0_In-1889800423 |P1Thread1of1ForFork0_#t~ite14_Out-1889800423|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1889800423, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1889800423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1889800423, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1889800423} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1889800423, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1889800423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1889800423, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1889800423|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1889800423} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 21:24:14,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_26|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_25|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 21:24:14,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t46~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t46~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12|) |v_ULTIMATE.start_main_~#t46~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t46~0.base_12|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t46~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_12|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t46~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t46~0.offset] because there is no mapped edge [2019-12-07 21:24:14,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In731637025 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite21_Out731637025| ~a$w_buff0~0_In731637025) (= |P2Thread1of1ForFork1_#t~ite20_In731637025| |P2Thread1of1ForFork1_#t~ite20_Out731637025|)) (and .cse0 (= ~a$w_buff0~0_In731637025 |P2Thread1of1ForFork1_#t~ite20_Out731637025|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In731637025 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In731637025 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In731637025 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In731637025 256))))) (= |P2Thread1of1ForFork1_#t~ite21_Out731637025| |P2Thread1of1ForFork1_#t~ite20_Out731637025|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In731637025|, ~a$w_buff0~0=~a$w_buff0~0_In731637025, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In731637025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In731637025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In731637025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In731637025, ~weak$$choice2~0=~weak$$choice2~0_In731637025} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out731637025|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out731637025|, ~a$w_buff0~0=~a$w_buff0~0_In731637025, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In731637025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In731637025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In731637025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In731637025, ~weak$$choice2~0=~weak$$choice2~0_In731637025} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 21:24:14,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-986504956 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-986504956 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-986504956 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In-986504956 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-986504956 256) 0))) (= |P2Thread1of1ForFork1_#t~ite26_Out-986504956| ~a$w_buff0_used~0_In-986504956) (= |P2Thread1of1ForFork1_#t~ite26_Out-986504956| |P2Thread1of1ForFork1_#t~ite27_Out-986504956|)) (and (= |P2Thread1of1ForFork1_#t~ite26_In-986504956| |P2Thread1of1ForFork1_#t~ite26_Out-986504956|) (= |P2Thread1of1ForFork1_#t~ite27_Out-986504956| ~a$w_buff0_used~0_In-986504956) (not .cse0)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-986504956|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-986504956, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-986504956, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-986504956, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-986504956, ~weak$$choice2~0=~weak$$choice2~0_In-986504956} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-986504956|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-986504956|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-986504956, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-986504956, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-986504956, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-986504956, ~weak$$choice2~0=~weak$$choice2~0_In-986504956} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 21:24:14,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 21:24:14,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 21:24:14,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1428107490 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1428107490 256) 0))) (or (and (= ~a~0_In1428107490 |P2Thread1of1ForFork1_#t~ite38_Out1428107490|) (or .cse0 .cse1)) (and (not .cse1) (= ~a$w_buff1~0_In1428107490 |P2Thread1of1ForFork1_#t~ite38_Out1428107490|) (not .cse0)))) InVars {~a~0=~a~0_In1428107490, ~a$w_buff1~0=~a$w_buff1~0_In1428107490, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1428107490, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1428107490} OutVars{~a~0=~a~0_In1428107490, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1428107490|, ~a$w_buff1~0=~a$w_buff1~0_In1428107490, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1428107490, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1428107490} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 21:24:14,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 21:24:14,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In2114761290 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In2114761290 256) 0))) (or (and (= ~a$w_buff0_used~0_In2114761290 |P2Thread1of1ForFork1_#t~ite40_Out2114761290|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out2114761290|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2114761290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2114761290} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2114761290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2114761290, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out2114761290|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 21:24:14,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In2126147209 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In2126147209 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2126147209 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In2126147209 256) 0))) (or (and (= ~a$w_buff1_used~0_In2126147209 |P2Thread1of1ForFork1_#t~ite41_Out2126147209|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out2126147209|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2126147209, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2126147209, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2126147209, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2126147209} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2126147209, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2126147209, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2126147209, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out2126147209|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2126147209} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 21:24:14,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1421356120 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1421356120 256)))) (or (and (= ~a$r_buff0_thd3~0_In-1421356120 |P2Thread1of1ForFork1_#t~ite42_Out-1421356120|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1421356120|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1421356120, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1421356120} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1421356120|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1421356120, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1421356120} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 21:24:14,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1445510027 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1445510027 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1445510027 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In1445510027 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite43_Out1445510027| 0)) (and (= |P2Thread1of1ForFork1_#t~ite43_Out1445510027| ~a$r_buff1_thd3~0_In1445510027) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1445510027, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1445510027, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1445510027, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1445510027} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1445510027|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1445510027, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1445510027, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1445510027, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1445510027} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 21:24:14,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_32|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 21:24:14,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In201306404 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In201306404 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out201306404| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In201306404 |P0Thread1of1ForFork2_#t~ite5_Out201306404|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In201306404, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In201306404} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out201306404|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In201306404, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In201306404} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 21:24:14,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1345775623 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1345775623 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1345775623 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1345775623 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite6_Out-1345775623| ~a$w_buff1_used~0_In-1345775623)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1345775623|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1345775623, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345775623, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1345775623, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345775623} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1345775623, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1345775623|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345775623, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1345775623, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345775623} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 21:24:14,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-909317594 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-909317594 256) 0)) (.cse2 (= ~a$r_buff0_thd1~0_In-909317594 ~a$r_buff0_thd1~0_Out-909317594))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-909317594) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-909317594, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-909317594} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-909317594|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-909317594, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-909317594} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:24:14,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In193267429 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In193267429 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In193267429 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In193267429 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite8_Out193267429| 0)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out193267429| ~a$r_buff1_thd1~0_In193267429) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In193267429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In193267429, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In193267429, ~a$w_buff1_used~0=~a$w_buff1_used~0_In193267429} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out193267429|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In193267429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In193267429, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In193267429, ~a$w_buff1_used~0=~a$w_buff1_used~0_In193267429} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 21:24:14,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_42| v_~a$r_buff1_thd1~0_72) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_41|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 21:24:14,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:24:14,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In2088449369 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In2088449369 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In2088449369 |ULTIMATE.start_main_#t~ite47_Out2088449369|)) (and (= ~a~0_In2088449369 |ULTIMATE.start_main_#t~ite47_Out2088449369|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In2088449369, ~a$w_buff1~0=~a$w_buff1~0_In2088449369, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2088449369, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2088449369} OutVars{~a~0=~a~0_In2088449369, ~a$w_buff1~0=~a$w_buff1~0_In2088449369, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2088449369|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2088449369, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2088449369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 21:24:14,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 21:24:14,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-671787214 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-671787214 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-671787214| ~a$w_buff0_used~0_In-671787214) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-671787214| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-671787214, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-671787214} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-671787214, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-671787214|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-671787214} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 21:24:14,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-221431766 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-221431766 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-221431766 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-221431766 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-221431766 |ULTIMATE.start_main_#t~ite50_Out-221431766|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-221431766| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-221431766, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221431766, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-221431766, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221431766} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-221431766|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-221431766, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221431766, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-221431766, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221431766} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 21:24:14,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-5072653 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-5072653 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-5072653| 0)) (and (= |ULTIMATE.start_main_#t~ite51_Out-5072653| ~a$r_buff0_thd0~0_In-5072653) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-5072653, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-5072653} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-5072653|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-5072653, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-5072653} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 21:24:14,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In-1880966589 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1880966589 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1880966589 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1880966589 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1880966589| ~a$r_buff1_thd0~0_In-1880966589) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-1880966589| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1880966589, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1880966589, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1880966589, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1880966589} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1880966589|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1880966589, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1880966589, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1880966589, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1880966589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 21:24:14,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:24:14,130 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_81d391e5-63ce-46c2-bbe2-4847ce4cb206/bin/utaipan/witness.graphml [2019-12-07 21:24:14,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:24:14,131 INFO L168 Benchmark]: Toolchain (without parser) took 77461.53 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 938.1 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-12-07 21:24:14,132 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:24:14,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:24:14,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:24:14,132 INFO L168 Benchmark]: Boogie Preprocessor took 26.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:24:14,133 INFO L168 Benchmark]: RCFGBuilder took 407.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.5 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:24:14,133 INFO L168 Benchmark]: TraceAbstraction took 76522.43 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 995.5 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-12-07 21:24:14,133 INFO L168 Benchmark]: Witness Printer took 73.96 ms. Allocated memory is still 6.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:24:14,134 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 407.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.5 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76522.43 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 995.5 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 73.96 ms. Allocated memory is still 6.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t44, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t45, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t46, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 76.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7139 SDtfs, 8328 SDslu, 24922 SDs, 0 SdLazy, 18238 SolverSat, 368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 51 SyntacticMatches, 20 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 239780 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1403 NumberOfCodeBlocks, 1403 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1306 ConstructedInterpolants, 0 QuantifiedInterpolants, 389129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...