./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe013_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_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe013_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/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 b1ca2361d71ac2cf79edaee81010c8705ab39c08 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:30:14,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:30:14,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:30:14,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:30:14,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:30:14,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:30:14,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:30:14,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:30:14,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:30:14,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:30:14,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:30:14,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:30:14,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:30:14,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:30:14,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:30:14,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:30:14,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:30:14,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:30:14,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:30:14,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:30:14,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:30:14,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:30:14,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:30:14,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:30:14,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:30:14,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:30:14,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:30:14,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:30:14,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:30:14,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:30:14,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:30:14,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:30:14,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:30:14,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:30:14,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:30:14,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:30:14,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:30:14,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:30:14,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:30:14,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:30:14,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:30:14,966 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:30:14,978 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:30:14,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:30:14,979 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:30:14,979 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:30:14,979 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:30:14,979 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:30:14,979 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:30:14,979 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:30:14,980 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:30:14,980 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:30:14,980 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:30:14,980 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:30:14,980 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:30:14,980 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:30:14,981 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:30:14,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:30:14,981 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:30:14,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:30:14,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:30:14,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:30:14,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:30:14,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:30:14,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:30:14,982 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:30:14,982 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:30:14,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:30:14,982 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:30:14,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:30:14,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:30:14,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:30:14,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:30:14,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:30:14,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:30:14,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:30:14,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:30:14,983 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:30:14,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:30:14,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:30:14,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:30:14,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:30:14,984 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_7a351f73-239b-4346-abab-76c21245a33b/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 -> b1ca2361d71ac2cf79edaee81010c8705ab39c08 [2019-12-07 19:30:15,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:30:15,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:30:15,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:30:15,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:30:15,107 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:30:15,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe013_pso.oepc.i [2019-12-07 19:30:15,151 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/data/27780c5d4/d848fdba9c6f4e07ac1b33e5624aec37/FLAG5868bf045 [2019-12-07 19:30:15,575 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:30:15,576 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/sv-benchmarks/c/pthread-wmm/safe013_pso.oepc.i [2019-12-07 19:30:15,588 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/data/27780c5d4/d848fdba9c6f4e07ac1b33e5624aec37/FLAG5868bf045 [2019-12-07 19:30:15,916 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/data/27780c5d4/d848fdba9c6f4e07ac1b33e5624aec37 [2019-12-07 19:30:15,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:30:15,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:30:15,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:30:15,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:30:15,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:30:15,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:30:15" (1/1) ... [2019-12-07 19:30:15,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77919ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:15, skipping insertion in model container [2019-12-07 19:30:15,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:30:15" (1/1) ... [2019-12-07 19:30:15,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:30:15,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:30:16,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:30:16,216 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:30:16,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:30:16,300 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:30:16,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16 WrapperNode [2019-12-07 19:30:16,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:30:16,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:30:16,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:30:16,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:30:16,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... [2019-12-07 19:30:16,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... [2019-12-07 19:30:16,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:30:16,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:30:16,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:30:16,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:30:16,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... [2019-12-07 19:30:16,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... [2019-12-07 19:30:16,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... [2019-12-07 19:30:16,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... [2019-12-07 19:30:16,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... [2019-12-07 19:30:16,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... [2019-12-07 19:30:16,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... [2019-12-07 19:30:16,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:30:16,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:30:16,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:30:16,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:30:16,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/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 19:30:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:30:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:30:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:30:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:30:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:30:16,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:30:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:30:16,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:30:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:30:16,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:30:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:30:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:30:16,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:30:16,403 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 19:30:16,753 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:30:16,754 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:30:16,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:30:16 BoogieIcfgContainer [2019-12-07 19:30:16,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:30:16,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:30:16,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:30:16,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:30:16,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:30:15" (1/3) ... [2019-12-07 19:30:16,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d24e2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:30:16, skipping insertion in model container [2019-12-07 19:30:16,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:16" (2/3) ... [2019-12-07 19:30:16,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d24e2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:30:16, skipping insertion in model container [2019-12-07 19:30:16,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:30:16" (3/3) ... [2019-12-07 19:30:16,759 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_pso.oepc.i [2019-12-07 19:30:16,765 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:30:16,765 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:30:16,770 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:30:16,770 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:30:16,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,794 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:30:16,823 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:30:16,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:30:16,836 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:30:16,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:30:16,836 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:30:16,836 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:30:16,836 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:30:16,836 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:30:16,836 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:30:16,847 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 19:30:16,848 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 19:30:16,899 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 19:30:16,899 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:30:16,909 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:30:16,923 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 19:30:16,952 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 19:30:16,953 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:30:16,957 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:30:16,971 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 19:30:16,972 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:30:19,940 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 19:30:20,075 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-07 19:30:20,076 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 19:30:20,078 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 19:30:29,531 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-07 19:30:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-07 19:30:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:30:29,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:29,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:30:29,537 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:29,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-07 19:30:29,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:29,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295376718] [2019-12-07 19:30:29,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:29,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295376718] [2019-12-07 19:30:29,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:29,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:30:29,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055541939] [2019-12-07 19:30:29,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:29,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:29,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:29,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:29,700 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-07 19:30:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:30,378 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-07 19:30:30,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:30,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 19:30:30,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:30,783 INFO L225 Difference]: With dead ends: 85012 [2019-12-07 19:30:30,783 INFO L226 Difference]: Without dead ends: 80140 [2019-12-07 19:30:30,784 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 19:30:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-07 19:30:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-07 19:30:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-07 19:30:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-07 19:30:35,068 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-07 19:30:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:35,068 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-07 19:30:35,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-07 19:30:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:30:35,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:35,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:35,078 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:35,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-07 19:30:35,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:35,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537073986] [2019-12-07 19:30:35,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:35,142 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 19:30:35,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537073986] [2019-12-07 19:30:35,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:35,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:30:35,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090672862] [2019-12-07 19:30:35,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:35,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:35,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:35,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:35,146 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-07 19:30:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:35,885 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-07 19:30:35,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:30:35,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:30:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:36,238 INFO L225 Difference]: With dead ends: 123388 [2019-12-07 19:30:36,238 INFO L226 Difference]: Without dead ends: 123290 [2019-12-07 19:30:36,239 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 19:30:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-07 19:30:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-07 19:30:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-07 19:30:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-07 19:30:43,342 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-07 19:30:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:43,343 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-07 19:30:43,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-07 19:30:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:30:43,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:43,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:43,346 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-07 19:30:43,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:43,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635703083] [2019-12-07 19:30:43,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:43,392 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 19:30:43,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635703083] [2019-12-07 19:30:43,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:43,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:30:43,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157146206] [2019-12-07 19:30:43,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:43,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:43,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:43,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:43,394 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-07 19:30:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:44,574 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-07 19:30:44,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:30:44,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:30:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:45,014 INFO L225 Difference]: With dead ends: 159677 [2019-12-07 19:30:45,014 INFO L226 Difference]: Without dead ends: 159565 [2019-12-07 19:30:45,015 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 19:30:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-07 19:30:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-07 19:30:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-07 19:30:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-07 19:30:52,909 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-07 19:30:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:52,909 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-07 19:30:52,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-07 19:30:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:30:52,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:52,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:52,913 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-07 19:30:52,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:52,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123442571] [2019-12-07 19:30:52,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:52,946 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 19:30:52,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123442571] [2019-12-07 19:30:52,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:52,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:52,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003122952] [2019-12-07 19:30:52,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:52,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:52,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:52,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:52,947 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-07 19:30:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:54,046 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-07 19:30:54,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:54,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 19:30:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:54,516 INFO L225 Difference]: With dead ends: 181618 [2019-12-07 19:30:54,517 INFO L226 Difference]: Without dead ends: 181618 [2019-12-07 19:30:54,517 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 19:30:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-07 19:31:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-07 19:31:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-07 19:31:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-07 19:31:01,543 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-07 19:31:01,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:31:01,543 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-07 19:31:01,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:31:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-07 19:31:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:31:01,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:31:01,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:31:01,547 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:31:01,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:31:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-07 19:31:01,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:31:01,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505698350] [2019-12-07 19:31:01,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:31:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:31:01,589 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 19:31:01,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505698350] [2019-12-07 19:31:01,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:31:01,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:31:01,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159049958] [2019-12-07 19:31:01,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:31:01,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:31:01,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:31:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:31:01,591 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-07 19:31:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:04,168 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-07 19:31:04,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:31:04,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:31:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:04,626 INFO L225 Difference]: With dead ends: 179622 [2019-12-07 19:31:04,627 INFO L226 Difference]: Without dead ends: 179542 [2019-12-07 19:31:04,627 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 19:31:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-07 19:31:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-07 19:31:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-07 19:31:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-07 19:31:11,518 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-07 19:31:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:31:11,518 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-07 19:31:11,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:31:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-07 19:31:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:31:11,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:31:11,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:31:11,523 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:31:11,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:31:11,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-07 19:31:11,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:31:11,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791066282] [2019-12-07 19:31:11,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:31:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:31:11,562 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 19:31:11,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791066282] [2019-12-07 19:31:11,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:31:11,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:31:11,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034579304] [2019-12-07 19:31:11,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:31:11,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:31:11,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:31:11,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:31:11,563 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-07 19:31:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:12,510 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-07 19:31:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:31:12,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:31:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:13,500 INFO L225 Difference]: With dead ends: 189091 [2019-12-07 19:31:13,501 INFO L226 Difference]: Without dead ends: 188995 [2019-12-07 19:31:13,501 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 19:31:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-07 19:31:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-07 19:31:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-07 19:31:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-07 19:31:22,557 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-07 19:31:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:31:22,558 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-07 19:31:22,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:31:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-07 19:31:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:31:22,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:31:22,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:31:22,571 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:31:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:31:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-07 19:31:22,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:31:22,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820234255] [2019-12-07 19:31:22,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:31:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:31:22,613 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 19:31:22,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820234255] [2019-12-07 19:31:22,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:31:22,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:31:22,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5985499] [2019-12-07 19:31:22,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:31:22,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:31:22,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:31:22,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:31:22,615 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-07 19:31:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:23,305 INFO L93 Difference]: Finished difference Result 152758 states and 623342 transitions. [2019-12-07 19:31:23,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:31:23,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:31:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:23,687 INFO L225 Difference]: With dead ends: 152758 [2019-12-07 19:31:23,687 INFO L226 Difference]: Without dead ends: 152758 [2019-12-07 19:31:23,688 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 19:31:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152758 states. [2019-12-07 19:31:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152758 to 148778. [2019-12-07 19:31:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148778 states. [2019-12-07 19:31:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148778 states to 148778 states and 608180 transitions. [2019-12-07 19:31:30,135 INFO L78 Accepts]: Start accepts. Automaton has 148778 states and 608180 transitions. Word has length 18 [2019-12-07 19:31:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:31:30,135 INFO L462 AbstractCegarLoop]: Abstraction has 148778 states and 608180 transitions. [2019-12-07 19:31:30,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:31:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 148778 states and 608180 transitions. [2019-12-07 19:31:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:31:30,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:31:30,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:31:30,145 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:31:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:31:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash 250695921, now seen corresponding path program 1 times [2019-12-07 19:31:30,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:31:30,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861065127] [2019-12-07 19:31:30,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:31:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:31:30,195 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 19:31:30,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861065127] [2019-12-07 19:31:30,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:31:30,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:31:30,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598951087] [2019-12-07 19:31:30,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:31:30,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:31:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:31:30,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:31:30,197 INFO L87 Difference]: Start difference. First operand 148778 states and 608180 transitions. Second operand 3 states. [2019-12-07 19:31:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:31,776 INFO L93 Difference]: Finished difference Result 277378 states and 1128575 transitions. [2019-12-07 19:31:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:31:31,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:31:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:32,454 INFO L225 Difference]: With dead ends: 277378 [2019-12-07 19:31:32,454 INFO L226 Difference]: Without dead ends: 268154 [2019-12-07 19:31:32,454 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 19:31:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268154 states. [2019-12-07 19:31:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268154 to 258617. [2019-12-07 19:31:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258617 states. [2019-12-07 19:31:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258617 states to 258617 states and 1060508 transitions. [2019-12-07 19:31:44,352 INFO L78 Accepts]: Start accepts. Automaton has 258617 states and 1060508 transitions. Word has length 18 [2019-12-07 19:31:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:31:44,352 INFO L462 AbstractCegarLoop]: Abstraction has 258617 states and 1060508 transitions. [2019-12-07 19:31:44,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:31:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 258617 states and 1060508 transitions. [2019-12-07 19:31:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:31:44,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:31:44,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:31:44,370 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:31:44,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:31:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1369748393, now seen corresponding path program 1 times [2019-12-07 19:31:44,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:31:44,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021403464] [2019-12-07 19:31:44,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:31:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:31:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:31:44,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021403464] [2019-12-07 19:31:44,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:31:44,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:31:44,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075184228] [2019-12-07 19:31:44,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:31:44,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:31:44,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:31:44,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:31:44,413 INFO L87 Difference]: Start difference. First operand 258617 states and 1060508 transitions. Second operand 4 states. [2019-12-07 19:31:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:46,015 INFO L93 Difference]: Finished difference Result 258630 states and 1059116 transitions. [2019-12-07 19:31:46,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:31:46,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 19:31:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:46,685 INFO L225 Difference]: With dead ends: 258630 [2019-12-07 19:31:46,685 INFO L226 Difference]: Without dead ends: 257550 [2019-12-07 19:31:46,686 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 19:31:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257550 states. [2019-12-07 19:31:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257550 to 256634. [2019-12-07 19:31:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256634 states. [2019-12-07 19:31:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256634 states to 256634 states and 1052948 transitions. [2019-12-07 19:31:56,510 INFO L78 Accepts]: Start accepts. Automaton has 256634 states and 1052948 transitions. Word has length 19 [2019-12-07 19:31:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:31:56,510 INFO L462 AbstractCegarLoop]: Abstraction has 256634 states and 1052948 transitions. [2019-12-07 19:31:56,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:31:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 256634 states and 1052948 transitions. [2019-12-07 19:31:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:31:56,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:31:56,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:31:56,531 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:31:56,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:31:56,531 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-07 19:31:56,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:31:56,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894879833] [2019-12-07 19:31:56,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:31:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:31:56,572 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 19:31:56,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894879833] [2019-12-07 19:31:56,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:31:56,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:31:56,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718341551] [2019-12-07 19:31:56,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:31:56,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:31:56,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:31:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:31:56,573 INFO L87 Difference]: Start difference. First operand 256634 states and 1052948 transitions. Second operand 4 states. [2019-12-07 19:31:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:56,822 INFO L93 Difference]: Finished difference Result 68188 states and 236427 transitions. [2019-12-07 19:31:56,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:31:56,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 19:31:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:56,919 INFO L225 Difference]: With dead ends: 68188 [2019-12-07 19:31:56,920 INFO L226 Difference]: Without dead ends: 51980 [2019-12-07 19:31:56,920 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 19:31:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51980 states. [2019-12-07 19:31:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51980 to 51528. [2019-12-07 19:31:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51528 states. [2019-12-07 19:32:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51528 states to 51528 states and 169398 transitions. [2019-12-07 19:32:00,100 INFO L78 Accepts]: Start accepts. Automaton has 51528 states and 169398 transitions. Word has length 19 [2019-12-07 19:32:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:00,100 INFO L462 AbstractCegarLoop]: Abstraction has 51528 states and 169398 transitions. [2019-12-07 19:32:00,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 51528 states and 169398 transitions. [2019-12-07 19:32:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:32:00,110 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:00,111 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 19:32:00,111 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-07 19:32:00,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:00,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31610909] [2019-12-07 19:32:00,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:00,156 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 19:32:00,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31610909] [2019-12-07 19:32:00,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:00,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:32:00,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394447115] [2019-12-07 19:32:00,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:32:00,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:32:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:00,157 INFO L87 Difference]: Start difference. First operand 51528 states and 169398 transitions. Second operand 5 states. [2019-12-07 19:32:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:00,592 INFO L93 Difference]: Finished difference Result 68990 states and 222417 transitions. [2019-12-07 19:32:00,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:32:00,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 19:32:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:00,698 INFO L225 Difference]: With dead ends: 68990 [2019-12-07 19:32:00,698 INFO L226 Difference]: Without dead ends: 68730 [2019-12-07 19:32:00,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:32:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68730 states. [2019-12-07 19:32:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68730 to 51750. [2019-12-07 19:32:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51750 states. [2019-12-07 19:32:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51750 states to 51750 states and 169913 transitions. [2019-12-07 19:32:01,699 INFO L78 Accepts]: Start accepts. Automaton has 51750 states and 169913 transitions. Word has length 22 [2019-12-07 19:32:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:01,700 INFO L462 AbstractCegarLoop]: Abstraction has 51750 states and 169913 transitions. [2019-12-07 19:32:01,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:32:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 51750 states and 169913 transitions. [2019-12-07 19:32:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:32:01,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:01,710 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 19:32:01,710 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-07 19:32:01,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:01,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251247547] [2019-12-07 19:32:01,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:01,746 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 19:32:01,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251247547] [2019-12-07 19:32:01,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:01,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:32:01,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831691838] [2019-12-07 19:32:01,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:32:01,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:01,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:32:01,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:01,748 INFO L87 Difference]: Start difference. First operand 51750 states and 169913 transitions. Second operand 5 states. [2019-12-07 19:32:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:02,323 INFO L93 Difference]: Finished difference Result 69587 states and 223996 transitions. [2019-12-07 19:32:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:32:02,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 19:32:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:02,433 INFO L225 Difference]: With dead ends: 69587 [2019-12-07 19:32:02,433 INFO L226 Difference]: Without dead ends: 69221 [2019-12-07 19:32:02,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:32:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69221 states. [2019-12-07 19:32:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69221 to 50292. [2019-12-07 19:32:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50292 states. [2019-12-07 19:32:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50292 states to 50292 states and 164881 transitions. [2019-12-07 19:32:03,427 INFO L78 Accepts]: Start accepts. Automaton has 50292 states and 164881 transitions. Word has length 22 [2019-12-07 19:32:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:03,428 INFO L462 AbstractCegarLoop]: Abstraction has 50292 states and 164881 transitions. [2019-12-07 19:32:03,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:32:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 50292 states and 164881 transitions. [2019-12-07 19:32:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:32:03,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:03,444 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 19:32:03,445 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-07 19:32:03,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:03,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092953150] [2019-12-07 19:32:03,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:03,484 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 19:32:03,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092953150] [2019-12-07 19:32:03,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:03,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:32:03,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861301421] [2019-12-07 19:32:03,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:32:03,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:32:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:03,485 INFO L87 Difference]: Start difference. First operand 50292 states and 164881 transitions. Second operand 5 states. [2019-12-07 19:32:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:03,577 INFO L93 Difference]: Finished difference Result 22458 states and 70498 transitions. [2019-12-07 19:32:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:32:03,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 19:32:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:03,601 INFO L225 Difference]: With dead ends: 22458 [2019-12-07 19:32:03,601 INFO L226 Difference]: Without dead ends: 19530 [2019-12-07 19:32:03,602 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 19:32:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2019-12-07 19:32:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 19530. [2019-12-07 19:32:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19530 states. [2019-12-07 19:32:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19530 states to 19530 states and 60996 transitions. [2019-12-07 19:32:03,872 INFO L78 Accepts]: Start accepts. Automaton has 19530 states and 60996 transitions. Word has length 25 [2019-12-07 19:32:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:03,872 INFO L462 AbstractCegarLoop]: Abstraction has 19530 states and 60996 transitions. [2019-12-07 19:32:03,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:32:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 19530 states and 60996 transitions. [2019-12-07 19:32:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:32:03,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:03,894 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 19:32:03,894 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:03,894 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-07 19:32:03,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:03,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459433300] [2019-12-07 19:32:03,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:03,939 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 19:32:03,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459433300] [2019-12-07 19:32:03,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:03,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:32:03,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261654387] [2019-12-07 19:32:03,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:32:03,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:03,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:32:03,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:03,940 INFO L87 Difference]: Start difference. First operand 19530 states and 60996 transitions. Second operand 6 states. [2019-12-07 19:32:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:04,337 INFO L93 Difference]: Finished difference Result 26598 states and 80341 transitions. [2019-12-07 19:32:04,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:32:04,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 19:32:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:04,368 INFO L225 Difference]: With dead ends: 26598 [2019-12-07 19:32:04,368 INFO L226 Difference]: Without dead ends: 26506 [2019-12-07 19:32:04,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:32:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26506 states. [2019-12-07 19:32:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26506 to 21729. [2019-12-07 19:32:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21729 states. [2019-12-07 19:32:04,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21729 states to 21729 states and 67198 transitions. [2019-12-07 19:32:04,784 INFO L78 Accepts]: Start accepts. Automaton has 21729 states and 67198 transitions. Word has length 40 [2019-12-07 19:32:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:04,784 INFO L462 AbstractCegarLoop]: Abstraction has 21729 states and 67198 transitions. [2019-12-07 19:32:04,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:32:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 21729 states and 67198 transitions. [2019-12-07 19:32:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:32:04,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:04,805 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 19:32:04,805 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2063605447, now seen corresponding path program 1 times [2019-12-07 19:32:04,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:04,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796405158] [2019-12-07 19:32:04,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:04,828 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 19:32:04,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796405158] [2019-12-07 19:32:04,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:04,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:32:04,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538107543] [2019-12-07 19:32:04,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:32:04,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:04,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:32:04,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:32:04,829 INFO L87 Difference]: Start difference. First operand 21729 states and 67198 transitions. Second operand 3 states. [2019-12-07 19:32:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:04,911 INFO L93 Difference]: Finished difference Result 24774 states and 74503 transitions. [2019-12-07 19:32:04,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:32:04,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 19:32:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:04,944 INFO L225 Difference]: With dead ends: 24774 [2019-12-07 19:32:04,944 INFO L226 Difference]: Without dead ends: 24774 [2019-12-07 19:32:04,944 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 19:32:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24774 states. [2019-12-07 19:32:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24774 to 22780. [2019-12-07 19:32:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22780 states. [2019-12-07 19:32:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22780 states to 22780 states and 68967 transitions. [2019-12-07 19:32:05,283 INFO L78 Accepts]: Start accepts. Automaton has 22780 states and 68967 transitions. Word has length 40 [2019-12-07 19:32:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:05,284 INFO L462 AbstractCegarLoop]: Abstraction has 22780 states and 68967 transitions. [2019-12-07 19:32:05,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:32:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 22780 states and 68967 transitions. [2019-12-07 19:32:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 19:32:05,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:05,307 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 19:32:05,307 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-07 19:32:05,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:05,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203070683] [2019-12-07 19:32:05,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:05,370 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 19:32:05,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203070683] [2019-12-07 19:32:05,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:05,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:32:05,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172148880] [2019-12-07 19:32:05,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:32:05,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:32:05,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:05,372 INFO L87 Difference]: Start difference. First operand 22780 states and 68967 transitions. Second operand 6 states. [2019-12-07 19:32:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:05,761 INFO L93 Difference]: Finished difference Result 26561 states and 79021 transitions. [2019-12-07 19:32:05,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:32:05,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 19:32:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:05,792 INFO L225 Difference]: With dead ends: 26561 [2019-12-07 19:32:05,792 INFO L226 Difference]: Without dead ends: 26469 [2019-12-07 19:32:05,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:32:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26469 states. [2019-12-07 19:32:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26469 to 20846. [2019-12-07 19:32:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20846 states. [2019-12-07 19:32:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20846 states to 20846 states and 63597 transitions. [2019-12-07 19:32:06,129 INFO L78 Accepts]: Start accepts. Automaton has 20846 states and 63597 transitions. Word has length 41 [2019-12-07 19:32:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:06,129 INFO L462 AbstractCegarLoop]: Abstraction has 20846 states and 63597 transitions. [2019-12-07 19:32:06,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:32:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 20846 states and 63597 transitions. [2019-12-07 19:32:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 19:32:06,155 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:06,156 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 19:32:06,156 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1237610810, now seen corresponding path program 1 times [2019-12-07 19:32:06,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:06,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913705090] [2019-12-07 19:32:06,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:06,204 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 19:32:06,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913705090] [2019-12-07 19:32:06,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:06,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:32:06,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837319535] [2019-12-07 19:32:06,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:32:06,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:06,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:32:06,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:06,206 INFO L87 Difference]: Start difference. First operand 20846 states and 63597 transitions. Second operand 5 states. [2019-12-07 19:32:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:06,565 INFO L93 Difference]: Finished difference Result 32121 states and 96604 transitions. [2019-12-07 19:32:06,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:32:06,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 19:32:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:06,605 INFO L225 Difference]: With dead ends: 32121 [2019-12-07 19:32:06,605 INFO L226 Difference]: Without dead ends: 32121 [2019-12-07 19:32:06,606 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 19:32:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32121 states. [2019-12-07 19:32:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32121 to 27934. [2019-12-07 19:32:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27934 states. [2019-12-07 19:32:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27934 states to 27934 states and 84791 transitions. [2019-12-07 19:32:07,109 INFO L78 Accepts]: Start accepts. Automaton has 27934 states and 84791 transitions. Word has length 41 [2019-12-07 19:32:07,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:07,110 INFO L462 AbstractCegarLoop]: Abstraction has 27934 states and 84791 transitions. [2019-12-07 19:32:07,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:32:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 27934 states and 84791 transitions. [2019-12-07 19:32:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 19:32:07,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:07,135 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 19:32:07,135 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:07,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:07,135 INFO L82 PathProgramCache]: Analyzing trace with hash 685009244, now seen corresponding path program 2 times [2019-12-07 19:32:07,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:07,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013937252] [2019-12-07 19:32:07,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:07,189 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 19:32:07,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013937252] [2019-12-07 19:32:07,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:07,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:32:07,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596093216] [2019-12-07 19:32:07,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:32:07,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:07,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:32:07,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:07,191 INFO L87 Difference]: Start difference. First operand 27934 states and 84791 transitions. Second operand 6 states. [2019-12-07 19:32:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:07,326 INFO L93 Difference]: Finished difference Result 26000 states and 80289 transitions. [2019-12-07 19:32:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:32:07,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 19:32:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:07,357 INFO L225 Difference]: With dead ends: 26000 [2019-12-07 19:32:07,357 INFO L226 Difference]: Without dead ends: 25789 [2019-12-07 19:32:07,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:32:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25789 states. [2019-12-07 19:32:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25789 to 14282. [2019-12-07 19:32:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14282 states. [2019-12-07 19:32:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14282 states to 14282 states and 44243 transitions. [2019-12-07 19:32:07,639 INFO L78 Accepts]: Start accepts. Automaton has 14282 states and 44243 transitions. Word has length 41 [2019-12-07 19:32:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:07,640 INFO L462 AbstractCegarLoop]: Abstraction has 14282 states and 44243 transitions. [2019-12-07 19:32:07,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:32:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14282 states and 44243 transitions. [2019-12-07 19:32:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:32:07,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:07,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:07,653 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:07,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:07,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1066766813, now seen corresponding path program 1 times [2019-12-07 19:32:07,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:07,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643925744] [2019-12-07 19:32:07,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:07,730 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 19:32:07,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643925744] [2019-12-07 19:32:07,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:07,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:32:07,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658597647] [2019-12-07 19:32:07,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:32:07,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:32:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:32:07,732 INFO L87 Difference]: Start difference. First operand 14282 states and 44243 transitions. Second operand 8 states. [2019-12-07 19:32:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:08,347 INFO L93 Difference]: Finished difference Result 41097 states and 126820 transitions. [2019-12-07 19:32:08,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:32:08,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-07 19:32:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:08,389 INFO L225 Difference]: With dead ends: 41097 [2019-12-07 19:32:08,389 INFO L226 Difference]: Without dead ends: 32185 [2019-12-07 19:32:08,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-07 19:32:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32185 states. [2019-12-07 19:32:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32185 to 17968. [2019-12-07 19:32:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17968 states. [2019-12-07 19:32:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17968 states to 17968 states and 56161 transitions. [2019-12-07 19:32:08,749 INFO L78 Accepts]: Start accepts. Automaton has 17968 states and 56161 transitions. Word has length 55 [2019-12-07 19:32:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:08,749 INFO L462 AbstractCegarLoop]: Abstraction has 17968 states and 56161 transitions. [2019-12-07 19:32:08,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:32:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 17968 states and 56161 transitions. [2019-12-07 19:32:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:32:08,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:08,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:08,766 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1783793399, now seen corresponding path program 2 times [2019-12-07 19:32:08,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:08,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534787962] [2019-12-07 19:32:08,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:08,833 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 19:32:08,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534787962] [2019-12-07 19:32:08,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:08,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:32:08,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656477837] [2019-12-07 19:32:08,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:32:08,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:08,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:32:08,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:32:08,834 INFO L87 Difference]: Start difference. First operand 17968 states and 56161 transitions. Second operand 8 states. [2019-12-07 19:32:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:09,489 INFO L93 Difference]: Finished difference Result 48263 states and 146903 transitions. [2019-12-07 19:32:09,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:32:09,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-07 19:32:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:09,535 INFO L225 Difference]: With dead ends: 48263 [2019-12-07 19:32:09,535 INFO L226 Difference]: Without dead ends: 36467 [2019-12-07 19:32:09,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-07 19:32:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36467 states. [2019-12-07 19:32:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36467 to 22365. [2019-12-07 19:32:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22365 states. [2019-12-07 19:32:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22365 states to 22365 states and 69591 transitions. [2019-12-07 19:32:09,977 INFO L78 Accepts]: Start accepts. Automaton has 22365 states and 69591 transitions. Word has length 55 [2019-12-07 19:32:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:09,978 INFO L462 AbstractCegarLoop]: Abstraction has 22365 states and 69591 transitions. [2019-12-07 19:32:09,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:32:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 22365 states and 69591 transitions. [2019-12-07 19:32:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:32:10,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:10,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:10,042 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:10,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1313399823, now seen corresponding path program 3 times [2019-12-07 19:32:10,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:10,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204754202] [2019-12-07 19:32:10,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:10,084 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 19:32:10,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204754202] [2019-12-07 19:32:10,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:10,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:32:10,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586566709] [2019-12-07 19:32:10,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:32:10,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:10,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:32:10,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:32:10,085 INFO L87 Difference]: Start difference. First operand 22365 states and 69591 transitions. Second operand 3 states. [2019-12-07 19:32:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:10,180 INFO L93 Difference]: Finished difference Result 38970 states and 121570 transitions. [2019-12-07 19:32:10,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:32:10,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:32:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:10,200 INFO L225 Difference]: With dead ends: 38970 [2019-12-07 19:32:10,200 INFO L226 Difference]: Without dead ends: 17088 [2019-12-07 19:32:10,200 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 19:32:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17088 states. [2019-12-07 19:32:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17088 to 17088. [2019-12-07 19:32:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17088 states. [2019-12-07 19:32:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17088 states to 17088 states and 53305 transitions. [2019-12-07 19:32:10,434 INFO L78 Accepts]: Start accepts. Automaton has 17088 states and 53305 transitions. Word has length 55 [2019-12-07 19:32:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:10,434 INFO L462 AbstractCegarLoop]: Abstraction has 17088 states and 53305 transitions. [2019-12-07 19:32:10,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:32:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 17088 states and 53305 transitions. [2019-12-07 19:32:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:32:10,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:10,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:10,450 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash 62198309, now seen corresponding path program 4 times [2019-12-07 19:32:10,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:10,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126188421] [2019-12-07 19:32:10,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:10,499 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 19:32:10,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126188421] [2019-12-07 19:32:10,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:10,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:32:10,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10636014] [2019-12-07 19:32:10,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:32:10,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:32:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:10,500 INFO L87 Difference]: Start difference. First operand 17088 states and 53305 transitions. Second operand 6 states. [2019-12-07 19:32:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:10,938 INFO L93 Difference]: Finished difference Result 21769 states and 66176 transitions. [2019-12-07 19:32:10,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:32:10,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-07 19:32:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:10,962 INFO L225 Difference]: With dead ends: 21769 [2019-12-07 19:32:10,962 INFO L226 Difference]: Without dead ends: 21769 [2019-12-07 19:32:10,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:32:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21769 states. [2019-12-07 19:32:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21769 to 17087. [2019-12-07 19:32:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17087 states. [2019-12-07 19:32:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17087 states to 17087 states and 53296 transitions. [2019-12-07 19:32:11,248 INFO L78 Accepts]: Start accepts. Automaton has 17087 states and 53296 transitions. Word has length 55 [2019-12-07 19:32:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:11,248 INFO L462 AbstractCegarLoop]: Abstraction has 17087 states and 53296 transitions. [2019-12-07 19:32:11,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:32:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 17087 states and 53296 transitions. [2019-12-07 19:32:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:32:11,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:11,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:11,264 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:11,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:11,265 INFO L82 PathProgramCache]: Analyzing trace with hash -435713207, now seen corresponding path program 5 times [2019-12-07 19:32:11,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:11,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863676730] [2019-12-07 19:32:11,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:11,325 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 19:32:11,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863676730] [2019-12-07 19:32:11,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:11,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:32:11,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901493604] [2019-12-07 19:32:11,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:32:11,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:32:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:11,326 INFO L87 Difference]: Start difference. First operand 17087 states and 53296 transitions. Second operand 7 states. [2019-12-07 19:32:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:11,584 INFO L93 Difference]: Finished difference Result 32092 states and 97903 transitions. [2019-12-07 19:32:11,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:32:11,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-07 19:32:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:11,618 INFO L225 Difference]: With dead ends: 32092 [2019-12-07 19:32:11,619 INFO L226 Difference]: Without dead ends: 27699 [2019-12-07 19:32:11,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:32:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27699 states. [2019-12-07 19:32:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27699 to 17417. [2019-12-07 19:32:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17417 states. [2019-12-07 19:32:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 54249 transitions. [2019-12-07 19:32:11,941 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 54249 transitions. Word has length 55 [2019-12-07 19:32:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:11,941 INFO L462 AbstractCegarLoop]: Abstraction has 17417 states and 54249 transitions. [2019-12-07 19:32:11,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:32:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 54249 transitions. [2019-12-07 19:32:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:32:11,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:11,958 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:11,958 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1276100617, now seen corresponding path program 6 times [2019-12-07 19:32:11,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:11,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640482697] [2019-12-07 19:32:11,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:12,014 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 19:32:12,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640482697] [2019-12-07 19:32:12,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:12,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:32:12,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902795233] [2019-12-07 19:32:12,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:32:12,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:12,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:32:12,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:12,015 INFO L87 Difference]: Start difference. First operand 17417 states and 54249 transitions. Second operand 7 states. [2019-12-07 19:32:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:12,259 INFO L93 Difference]: Finished difference Result 33295 states and 100778 transitions. [2019-12-07 19:32:12,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:32:12,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-07 19:32:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:12,293 INFO L225 Difference]: With dead ends: 33295 [2019-12-07 19:32:12,293 INFO L226 Difference]: Without dead ends: 27823 [2019-12-07 19:32:12,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:32:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27823 states. [2019-12-07 19:32:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27823 to 17443. [2019-12-07 19:32:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17443 states. [2019-12-07 19:32:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17443 states to 17443 states and 54281 transitions. [2019-12-07 19:32:12,666 INFO L78 Accepts]: Start accepts. Automaton has 17443 states and 54281 transitions. Word has length 55 [2019-12-07 19:32:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:12,666 INFO L462 AbstractCegarLoop]: Abstraction has 17443 states and 54281 transitions. [2019-12-07 19:32:12,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:32:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 17443 states and 54281 transitions. [2019-12-07 19:32:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:32:12,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:12,681 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:12,681 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash -808118167, now seen corresponding path program 7 times [2019-12-07 19:32:12,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:12,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337136627] [2019-12-07 19:32:12,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:12,746 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 19:32:12,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337136627] [2019-12-07 19:32:12,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:12,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:32:12,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052373475] [2019-12-07 19:32:12,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:32:12,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:12,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:32:12,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:32:12,747 INFO L87 Difference]: Start difference. First operand 17443 states and 54281 transitions. Second operand 9 states. [2019-12-07 19:32:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:13,433 INFO L93 Difference]: Finished difference Result 41931 states and 127050 transitions. [2019-12-07 19:32:13,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:32:13,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-07 19:32:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:13,484 INFO L225 Difference]: With dead ends: 41931 [2019-12-07 19:32:13,484 INFO L226 Difference]: Without dead ends: 40621 [2019-12-07 19:32:13,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-07 19:32:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40621 states. [2019-12-07 19:32:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40621 to 17455. [2019-12-07 19:32:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17455 states. [2019-12-07 19:32:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17455 states to 17455 states and 54342 transitions. [2019-12-07 19:32:13,900 INFO L78 Accepts]: Start accepts. Automaton has 17455 states and 54342 transitions. Word has length 55 [2019-12-07 19:32:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:13,900 INFO L462 AbstractCegarLoop]: Abstraction has 17455 states and 54342 transitions. [2019-12-07 19:32:13,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:32:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 17455 states and 54342 transitions. [2019-12-07 19:32:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:32:13,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:13,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:13,916 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2126472303, now seen corresponding path program 8 times [2019-12-07 19:32:13,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:13,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606844429] [2019-12-07 19:32:13,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:13,945 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 19:32:13,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606844429] [2019-12-07 19:32:13,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:13,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:32:13,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168111657] [2019-12-07 19:32:13,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:32:13,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:32:13,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:32:13,947 INFO L87 Difference]: Start difference. First operand 17455 states and 54342 transitions. Second operand 3 states. [2019-12-07 19:32:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:13,991 INFO L93 Difference]: Finished difference Result 13979 states and 42528 transitions. [2019-12-07 19:32:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:32:13,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:32:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:14,007 INFO L225 Difference]: With dead ends: 13979 [2019-12-07 19:32:14,007 INFO L226 Difference]: Without dead ends: 13979 [2019-12-07 19:32:14,008 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 19:32:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13979 states. [2019-12-07 19:32:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13979 to 13263. [2019-12-07 19:32:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13263 states. [2019-12-07 19:32:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13263 states to 13263 states and 40325 transitions. [2019-12-07 19:32:14,206 INFO L78 Accepts]: Start accepts. Automaton has 13263 states and 40325 transitions. Word has length 55 [2019-12-07 19:32:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:14,206 INFO L462 AbstractCegarLoop]: Abstraction has 13263 states and 40325 transitions. [2019-12-07 19:32:14,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:32:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 13263 states and 40325 transitions. [2019-12-07 19:32:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:32:14,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:14,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:14,219 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-07 19:32:14,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:14,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646083129] [2019-12-07 19:32:14,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:14,345 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 19:32:14,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646083129] [2019-12-07 19:32:14,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:14,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:32:14,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033506713] [2019-12-07 19:32:14,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:32:14,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:14,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:32:14,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:32:14,346 INFO L87 Difference]: Start difference. First operand 13263 states and 40325 transitions. Second operand 11 states. [2019-12-07 19:32:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:14,984 INFO L93 Difference]: Finished difference Result 28465 states and 85865 transitions. [2019-12-07 19:32:14,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 19:32:14,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 19:32:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:15,008 INFO L225 Difference]: With dead ends: 28465 [2019-12-07 19:32:15,008 INFO L226 Difference]: Without dead ends: 20820 [2019-12-07 19:32:15,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 19:32:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20820 states. [2019-12-07 19:32:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20820 to 13377. [2019-12-07 19:32:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13377 states. [2019-12-07 19:32:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13377 states to 13377 states and 40209 transitions. [2019-12-07 19:32:15,248 INFO L78 Accepts]: Start accepts. Automaton has 13377 states and 40209 transitions. Word has length 56 [2019-12-07 19:32:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:15,248 INFO L462 AbstractCegarLoop]: Abstraction has 13377 states and 40209 transitions. [2019-12-07 19:32:15,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:32:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 13377 states and 40209 transitions. [2019-12-07 19:32:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:32:15,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:15,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:15,261 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1822247207, now seen corresponding path program 2 times [2019-12-07 19:32:15,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:15,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262411935] [2019-12-07 19:32:15,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:15,390 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 19:32:15,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262411935] [2019-12-07 19:32:15,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:15,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:32:15,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340239263] [2019-12-07 19:32:15,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:32:15,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:15,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:32:15,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:32:15,391 INFO L87 Difference]: Start difference. First operand 13377 states and 40209 transitions. Second operand 12 states. [2019-12-07 19:32:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:15,926 INFO L93 Difference]: Finished difference Result 21222 states and 63352 transitions. [2019-12-07 19:32:15,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:32:15,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 19:32:15,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:15,951 INFO L225 Difference]: With dead ends: 21222 [2019-12-07 19:32:15,951 INFO L226 Difference]: Without dead ends: 20624 [2019-12-07 19:32:15,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-07 19:32:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20624 states. [2019-12-07 19:32:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20624 to 13059. [2019-12-07 19:32:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13059 states. [2019-12-07 19:32:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13059 states to 13059 states and 39345 transitions. [2019-12-07 19:32:16,197 INFO L78 Accepts]: Start accepts. Automaton has 13059 states and 39345 transitions. Word has length 56 [2019-12-07 19:32:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:16,197 INFO L462 AbstractCegarLoop]: Abstraction has 13059 states and 39345 transitions. [2019-12-07 19:32:16,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:32:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13059 states and 39345 transitions. [2019-12-07 19:32:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:32:16,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:16,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:16,210 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 3 times [2019-12-07 19:32:16,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:16,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069736564] [2019-12-07 19:32:16,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:32:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:32:16,272 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:32:16,272 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:32:16,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30| 1)) (= |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2079~0.base_30|) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30|) |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30|)) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| 4) |v_#length_23|) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ULTIMATE.start_main_~#t2079~0.offset=|v_ULTIMATE.start_main_~#t2079~0.offset_22|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_31|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2079~0.base=|v_ULTIMATE.start_main_~#t2079~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_22|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2081~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ULTIMATE.start_main_~#t2081~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2079~0.offset, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2079~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2080~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2080~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:32:16,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10|) |v_ULTIMATE.start_main_~#t2080~0.offset_9| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2080~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2080~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2080~0.base, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2080~0.offset] because there is no mapped edge [2019-12-07 19:32:16,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_97 256))) (not (= 0 (mod v_~x$w_buff1_used~0_52 256))))) 1 0)) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:32:16,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2081~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11|) |v_ULTIMATE.start_main_~#t2081~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2081~0.base_11|) (= |v_ULTIMATE.start_main_~#t2081~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2081~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2081~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 19:32:16,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1147783629 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1147783629 256) 0))) (or (and (= ~x~0_In1147783629 |P2Thread1of1ForFork1_#t~ite32_Out1147783629|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out1147783629| ~x$w_buff1~0_In1147783629) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1147783629, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1147783629, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1147783629, ~x~0=~x~0_In1147783629} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1147783629|, ~x$w_buff1~0=~x$w_buff1~0_In1147783629, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1147783629, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1147783629, ~x~0=~x~0_In1147783629} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:32:16,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:32:16,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2065284406 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In2065284406 256) 0))) (or (and (= ~x$w_buff0_used~0_In2065284406 |P2Thread1of1ForFork1_#t~ite34_Out2065284406|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out2065284406|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2065284406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2065284406} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out2065284406|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2065284406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2065284406} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:32:16,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In968374911 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In968374911 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out968374911| 0)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out968374911| ~x$w_buff0_used~0_In968374911) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In968374911, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968374911} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In968374911, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out968374911|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968374911} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:32:16,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In763618595 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In763618595 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In763618595 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In763618595 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out763618595|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In763618595 |P1Thread1of1ForFork0_#t~ite29_Out763618595|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In763618595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In763618595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In763618595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In763618595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In763618595, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out763618595|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:32:16,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In1269456779 ~x$r_buff0_thd2~0_Out1269456779)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1269456779 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1269456779 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (= 0 ~x$r_buff0_thd2~0_Out1269456779) (not .cse2) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1269456779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269456779} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1269456779|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1269456779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269456779} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:32:16,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1245739146 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1245739146 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1245739146 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1245739146 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1245739146|)) (and (= ~x$r_buff1_thd2~0_In-1245739146 |P1Thread1of1ForFork0_#t~ite31_Out-1245739146|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1245739146, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1245739146, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1245739146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1245739146} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1245739146|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1245739146, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1245739146, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1245739146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1245739146} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:32:16,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:32:16,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-337019291 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out-337019291| ~x$w_buff0~0_In-337019291) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-337019291 256)))) (or (= (mod ~x$w_buff0_used~0_In-337019291 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-337019291 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-337019291 256))))) (= |P0Thread1of1ForFork2_#t~ite9_Out-337019291| |P0Thread1of1ForFork2_#t~ite8_Out-337019291|)) (and (= |P0Thread1of1ForFork2_#t~ite8_In-337019291| |P0Thread1of1ForFork2_#t~ite8_Out-337019291|) (= |P0Thread1of1ForFork2_#t~ite9_Out-337019291| ~x$w_buff0~0_In-337019291) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-337019291, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-337019291, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-337019291|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-337019291, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-337019291, ~weak$$choice2~0=~weak$$choice2~0_In-337019291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-337019291} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-337019291, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-337019291, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-337019291|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-337019291, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-337019291|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-337019291, ~weak$$choice2~0=~weak$$choice2~0_In-337019291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-337019291} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 19:32:16,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In2096997542 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2096997542 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2096997542 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In2096997542 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2096997542 |P2Thread1of1ForFork1_#t~ite35_Out2096997542|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out2096997542|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2096997542, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2096997542, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2096997542, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2096997542} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2096997542|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2096997542, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2096997542, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2096997542, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2096997542} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:32:16,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-167468437 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-167468437 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-167468437|)) (and (= ~x$r_buff0_thd3~0_In-167468437 |P2Thread1of1ForFork1_#t~ite36_Out-167468437|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-167468437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167468437} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-167468437|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-167468437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167468437} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:32:16,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In532205848 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In532205848 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In532205848 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In532205848 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out532205848|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In532205848 |P2Thread1of1ForFork1_#t~ite37_Out532205848|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In532205848, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In532205848, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In532205848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532205848} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out532205848|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532205848, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In532205848, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In532205848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532205848} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:32:16,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:32:16,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1312607605 256) 0))) (or (and (= ~x$w_buff1_used~0_In1312607605 |P0Thread1of1ForFork2_#t~ite17_Out1312607605|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1312607605 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1312607605 256) 0) .cse0) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1312607605 256))) (= 0 (mod ~x$w_buff0_used~0_In1312607605 256)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out1312607605| |P0Thread1of1ForFork2_#t~ite18_Out1312607605|)) (and (= |P0Thread1of1ForFork2_#t~ite17_In1312607605| |P0Thread1of1ForFork2_#t~ite17_Out1312607605|) (= ~x$w_buff1_used~0_In1312607605 |P0Thread1of1ForFork2_#t~ite18_Out1312607605|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1312607605, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1312607605|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312607605, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1312607605, ~weak$$choice2~0=~weak$$choice2~0_In1312607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312607605} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1312607605, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1312607605|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1312607605|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312607605, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1312607605, ~weak$$choice2~0=~weak$$choice2~0_In1312607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312607605} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:32:16,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:32:16,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-393500617 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-393500617| |P0Thread1of1ForFork2_#t~ite24_Out-393500617|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-393500617 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-393500617 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-393500617 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In-393500617 256) 0))) (= ~x$r_buff1_thd1~0_In-393500617 |P0Thread1of1ForFork2_#t~ite23_Out-393500617|) .cse1) (and (= ~x$r_buff1_thd1~0_In-393500617 |P0Thread1of1ForFork2_#t~ite24_Out-393500617|) (= |P0Thread1of1ForFork2_#t~ite23_In-393500617| |P0Thread1of1ForFork2_#t~ite23_Out-393500617|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-393500617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-393500617, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-393500617, ~weak$$choice2~0=~weak$$choice2~0_In-393500617, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-393500617|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-393500617} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-393500617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-393500617, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-393500617, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-393500617|, ~weak$$choice2~0=~weak$$choice2~0_In-393500617, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-393500617|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-393500617} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 19:32:16,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:32:16,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:32:16,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-557718895 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-557718895 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-557718895| ~x$w_buff1~0_In-557718895)) (and (= |ULTIMATE.start_main_#t~ite41_Out-557718895| ~x~0_In-557718895) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-557718895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-557718895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-557718895, ~x~0=~x~0_In-557718895} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-557718895|, ~x$w_buff1~0=~x$w_buff1~0_In-557718895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-557718895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-557718895, ~x~0=~x~0_In-557718895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:32:16,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 19:32:16,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-513326958 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-513326958 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-513326958| ~x$w_buff0_used~0_In-513326958) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-513326958| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-513326958, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-513326958|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:32:16,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In108298849 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In108298849 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In108298849 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In108298849 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out108298849| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out108298849| ~x$w_buff1_used~0_In108298849) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In108298849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In108298849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In108298849, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out108298849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:32:16,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1218618018 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1218618018 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1218618018| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1218618018| ~x$r_buff0_thd0~0_In1218618018) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1218618018, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1218618018} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1218618018, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1218618018|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1218618018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:32:16,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-791148359 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-791148359 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-791148359 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-791148359 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-791148359| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-791148359 |ULTIMATE.start_main_#t~ite46_Out-791148359|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-791148359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791148359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-791148359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791148359} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-791148359, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-791148359|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791148359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-791148359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791148359} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:32:16,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= v_~z~0_60 2) (= 1 v_~__unbuffered_p2_EAX~0_35) (= 0 v_~__unbuffered_p0_EAX~0_54))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:32:16,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:32:16 BasicIcfg [2019-12-07 19:32:16,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:32:16,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:32:16,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:32:16,334 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:32:16,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:30:16" (3/4) ... [2019-12-07 19:32:16,336 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:32:16,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30| 1)) (= |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2079~0.base_30|) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30|) |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30|)) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| 4) |v_#length_23|) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ULTIMATE.start_main_~#t2079~0.offset=|v_ULTIMATE.start_main_~#t2079~0.offset_22|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_31|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2079~0.base=|v_ULTIMATE.start_main_~#t2079~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_22|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2081~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ULTIMATE.start_main_~#t2081~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2079~0.offset, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2079~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2080~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2080~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:32:16,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10|) |v_ULTIMATE.start_main_~#t2080~0.offset_9| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2080~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2080~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2080~0.base, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2080~0.offset] because there is no mapped edge [2019-12-07 19:32:16,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_97 256))) (not (= 0 (mod v_~x$w_buff1_used~0_52 256))))) 1 0)) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:32:16,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2081~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11|) |v_ULTIMATE.start_main_~#t2081~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2081~0.base_11|) (= |v_ULTIMATE.start_main_~#t2081~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2081~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2081~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 19:32:16,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1147783629 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1147783629 256) 0))) (or (and (= ~x~0_In1147783629 |P2Thread1of1ForFork1_#t~ite32_Out1147783629|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out1147783629| ~x$w_buff1~0_In1147783629) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1147783629, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1147783629, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1147783629, ~x~0=~x~0_In1147783629} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1147783629|, ~x$w_buff1~0=~x$w_buff1~0_In1147783629, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1147783629, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1147783629, ~x~0=~x~0_In1147783629} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:32:16,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:32:16,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2065284406 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In2065284406 256) 0))) (or (and (= ~x$w_buff0_used~0_In2065284406 |P2Thread1of1ForFork1_#t~ite34_Out2065284406|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out2065284406|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2065284406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2065284406} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out2065284406|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2065284406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2065284406} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:32:16,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In968374911 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In968374911 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out968374911| 0)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out968374911| ~x$w_buff0_used~0_In968374911) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In968374911, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968374911} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In968374911, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out968374911|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968374911} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:32:16,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In763618595 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In763618595 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In763618595 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In763618595 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out763618595|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In763618595 |P1Thread1of1ForFork0_#t~ite29_Out763618595|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In763618595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In763618595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In763618595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In763618595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In763618595, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out763618595|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:32:16,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In1269456779 ~x$r_buff0_thd2~0_Out1269456779)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1269456779 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1269456779 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (= 0 ~x$r_buff0_thd2~0_Out1269456779) (not .cse2) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1269456779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269456779} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1269456779|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1269456779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269456779} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:32:16,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1245739146 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1245739146 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1245739146 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1245739146 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1245739146|)) (and (= ~x$r_buff1_thd2~0_In-1245739146 |P1Thread1of1ForFork0_#t~ite31_Out-1245739146|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1245739146, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1245739146, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1245739146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1245739146} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1245739146|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1245739146, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1245739146, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1245739146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1245739146} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:32:16,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:32:16,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-337019291 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out-337019291| ~x$w_buff0~0_In-337019291) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-337019291 256)))) (or (= (mod ~x$w_buff0_used~0_In-337019291 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-337019291 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-337019291 256))))) (= |P0Thread1of1ForFork2_#t~ite9_Out-337019291| |P0Thread1of1ForFork2_#t~ite8_Out-337019291|)) (and (= |P0Thread1of1ForFork2_#t~ite8_In-337019291| |P0Thread1of1ForFork2_#t~ite8_Out-337019291|) (= |P0Thread1of1ForFork2_#t~ite9_Out-337019291| ~x$w_buff0~0_In-337019291) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-337019291, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-337019291, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-337019291|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-337019291, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-337019291, ~weak$$choice2~0=~weak$$choice2~0_In-337019291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-337019291} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-337019291, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-337019291, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-337019291|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-337019291, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-337019291|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-337019291, ~weak$$choice2~0=~weak$$choice2~0_In-337019291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-337019291} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 19:32:16,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In2096997542 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2096997542 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2096997542 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In2096997542 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2096997542 |P2Thread1of1ForFork1_#t~ite35_Out2096997542|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out2096997542|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2096997542, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2096997542, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2096997542, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2096997542} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2096997542|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2096997542, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2096997542, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2096997542, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2096997542} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:32:16,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-167468437 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-167468437 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-167468437|)) (and (= ~x$r_buff0_thd3~0_In-167468437 |P2Thread1of1ForFork1_#t~ite36_Out-167468437|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-167468437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167468437} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-167468437|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-167468437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167468437} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:32:16,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In532205848 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In532205848 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In532205848 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In532205848 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out532205848|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In532205848 |P2Thread1of1ForFork1_#t~ite37_Out532205848|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In532205848, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In532205848, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In532205848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532205848} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out532205848|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532205848, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In532205848, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In532205848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532205848} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:32:16,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:32:16,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1312607605 256) 0))) (or (and (= ~x$w_buff1_used~0_In1312607605 |P0Thread1of1ForFork2_#t~ite17_Out1312607605|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1312607605 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1312607605 256) 0) .cse0) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1312607605 256))) (= 0 (mod ~x$w_buff0_used~0_In1312607605 256)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out1312607605| |P0Thread1of1ForFork2_#t~ite18_Out1312607605|)) (and (= |P0Thread1of1ForFork2_#t~ite17_In1312607605| |P0Thread1of1ForFork2_#t~ite17_Out1312607605|) (= ~x$w_buff1_used~0_In1312607605 |P0Thread1of1ForFork2_#t~ite18_Out1312607605|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1312607605, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1312607605|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312607605, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1312607605, ~weak$$choice2~0=~weak$$choice2~0_In1312607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312607605} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1312607605, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1312607605|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1312607605|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312607605, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1312607605, ~weak$$choice2~0=~weak$$choice2~0_In1312607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312607605} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:32:16,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:32:16,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-393500617 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-393500617| |P0Thread1of1ForFork2_#t~ite24_Out-393500617|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-393500617 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-393500617 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-393500617 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In-393500617 256) 0))) (= ~x$r_buff1_thd1~0_In-393500617 |P0Thread1of1ForFork2_#t~ite23_Out-393500617|) .cse1) (and (= ~x$r_buff1_thd1~0_In-393500617 |P0Thread1of1ForFork2_#t~ite24_Out-393500617|) (= |P0Thread1of1ForFork2_#t~ite23_In-393500617| |P0Thread1of1ForFork2_#t~ite23_Out-393500617|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-393500617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-393500617, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-393500617, ~weak$$choice2~0=~weak$$choice2~0_In-393500617, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-393500617|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-393500617} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-393500617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-393500617, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-393500617, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-393500617|, ~weak$$choice2~0=~weak$$choice2~0_In-393500617, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-393500617|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-393500617} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 19:32:16,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:32:16,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:32:16,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-557718895 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-557718895 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-557718895| ~x$w_buff1~0_In-557718895)) (and (= |ULTIMATE.start_main_#t~ite41_Out-557718895| ~x~0_In-557718895) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-557718895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-557718895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-557718895, ~x~0=~x~0_In-557718895} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-557718895|, ~x$w_buff1~0=~x$w_buff1~0_In-557718895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-557718895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-557718895, ~x~0=~x~0_In-557718895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:32:16,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 19:32:16,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-513326958 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-513326958 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-513326958| ~x$w_buff0_used~0_In-513326958) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-513326958| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-513326958, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-513326958|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:32:16,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In108298849 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In108298849 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In108298849 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In108298849 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out108298849| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out108298849| ~x$w_buff1_used~0_In108298849) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In108298849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In108298849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In108298849, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out108298849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:32:16,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1218618018 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1218618018 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1218618018| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1218618018| ~x$r_buff0_thd0~0_In1218618018) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1218618018, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1218618018} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1218618018, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1218618018|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1218618018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:32:16,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-791148359 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-791148359 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-791148359 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-791148359 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-791148359| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-791148359 |ULTIMATE.start_main_#t~ite46_Out-791148359|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-791148359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791148359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-791148359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791148359} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-791148359, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-791148359|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791148359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-791148359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791148359} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:32:16,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= v_~z~0_60 2) (= 1 v_~__unbuffered_p2_EAX~0_35) (= 0 v_~__unbuffered_p0_EAX~0_54))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:32:16,396 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7a351f73-239b-4346-abab-76c21245a33b/bin/utaipan/witness.graphml [2019-12-07 19:32:16,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:32:16,397 INFO L168 Benchmark]: Toolchain (without parser) took 120478.75 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 934.0 MB in the beginning and 4.5 GB in the end (delta: -3.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 19:32:16,398 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:32:16,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:16,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.80 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 19:32:16,398 INFO L168 Benchmark]: Boogie Preprocessor took 24.71 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 19:32:16,399 INFO L168 Benchmark]: RCFGBuilder took 393.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:16,399 INFO L168 Benchmark]: TraceAbstraction took 119578.23 ms. Allocated memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 19:32:16,399 INFO L168 Benchmark]: Witness Printer took 62.94 ms. Allocated memory is still 6.3 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:16,401 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.71 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 393.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119578.23 ms. Allocated memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 62.94 ms. Allocated memory is still 6.3 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2079, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2080, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2081, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.4s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5511 SDtfs, 7637 SDslu, 15802 SDs, 0 SdLazy, 6512 SolverSat, 317 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 44 SyntacticMatches, 11 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258617occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 80.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 282456 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1027 NumberOfCodeBlocks, 1027 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 943 ConstructedInterpolants, 0 QuantifiedInterpolants, 143731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...