./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66bd96ca17eda037d6b50686600c4452437b4688 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:09:34,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:09:34,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:09:34,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:09:34,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:09:34,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:09:34,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:09:34,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:09:34,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:09:34,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:09:34,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:09:34,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:09:34,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:09:34,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:09:34,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:09:34,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:09:34,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:09:35,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:09:35,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:09:35,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:09:35,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:09:35,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:09:35,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:09:35,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:09:35,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:09:35,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:09:35,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:09:35,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:09:35,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:09:35,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:09:35,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:09:35,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:09:35,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:09:35,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:09:35,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:09:35,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:09:35,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:09:35,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:09:35,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:09:35,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:09:35,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:09:35,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:09:35,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:09:35,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:09:35,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:09:35,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:09:35,031 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:09:35,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:09:35,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:09:35,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:09:35,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:09:35,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:09:35,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:09:35,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:09:35,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:09:35,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:09:35,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:09:35,033 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:09:35,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:09:35,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:09:35,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:09:35,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:09:35,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:09:35,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:09:35,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:09:35,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:09:35,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:09:35,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:09:35,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:09:35,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:09:35,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:09:35,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66bd96ca17eda037d6b50686600c4452437b4688 [2019-12-07 10:09:35,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:09:35,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:09:35,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:09:35,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:09:35,161 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:09:35,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i [2019-12-07 10:09:35,199 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/data/c074db251/f41fb0da84674462a1de02691f8d7740/FLAG052eeb711 [2019-12-07 10:09:35,661 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:09:35,661 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i [2019-12-07 10:09:35,671 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/data/c074db251/f41fb0da84674462a1de02691f8d7740/FLAG052eeb711 [2019-12-07 10:09:35,680 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/data/c074db251/f41fb0da84674462a1de02691f8d7740 [2019-12-07 10:09:35,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:09:35,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:09:35,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:09:35,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:09:35,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:09:35,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:09:35" (1/1) ... [2019-12-07 10:09:35,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:35, skipping insertion in model container [2019-12-07 10:09:35,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:09:35" (1/1) ... [2019-12-07 10:09:35,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:09:35,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:09:35,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:09:36,004 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:09:36,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:09:36,113 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:09:36,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36 WrapperNode [2019-12-07 10:09:36,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:09:36,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:09:36,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:09:36,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:09:36,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... [2019-12-07 10:09:36,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... [2019-12-07 10:09:36,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:09:36,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:09:36,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:09:36,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:09:36,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... [2019-12-07 10:09:36,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... [2019-12-07 10:09:36,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... [2019-12-07 10:09:36,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... [2019-12-07 10:09:36,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... [2019-12-07 10:09:36,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... [2019-12-07 10:09:36,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... [2019-12-07 10:09:36,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:09:36,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:09:36,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:09:36,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:09:36,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:09:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:09:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:09:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:09:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:09:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:09:36,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:09:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:09:36,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:09:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:09:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:09:36,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:09:36,223 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:09:36,542 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:09:36,542 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:09:36,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:09:36 BoogieIcfgContainer [2019-12-07 10:09:36,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:09:36,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:09:36,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:09:36,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:09:36,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:09:35" (1/3) ... [2019-12-07 10:09:36,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7308d394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:09:36, skipping insertion in model container [2019-12-07 10:09:36,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:36" (2/3) ... [2019-12-07 10:09:36,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7308d394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:09:36, skipping insertion in model container [2019-12-07 10:09:36,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:09:36" (3/3) ... [2019-12-07 10:09:36,548 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.opt.i [2019-12-07 10:09:36,556 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:09:36,556 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:09:36,561 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:09:36,562 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:09:36,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:09:36,618 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:09:36,632 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:09:36,632 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:09:36,632 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:09:36,632 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:09:36,632 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:09:36,632 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:09:36,632 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:09:36,632 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:09:36,645 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-07 10:09:36,646 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 10:09:36,702 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 10:09:36,702 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:09:36,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 10:09:36,725 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 10:09:36,751 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 10:09:36,751 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:09:36,757 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 10:09:36,771 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 10:09:36,772 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:09:39,234 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 10:09:39,382 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-07 10:09:39,634 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-12-07 10:09:39,634 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-07 10:09:39,636 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-07 10:09:39,879 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-07 10:09:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-07 10:09:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:09:39,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:39,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:09:39,885 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-12-07 10:09:39,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:39,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591797417] [2019-12-07 10:09:39,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:40,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591797417] [2019-12-07 10:09:40,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:40,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:09:40,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170679007] [2019-12-07 10:09:40,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:40,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:40,060 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-07 10:09:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:40,206 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-12-07 10:09:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:40,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:09:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:40,258 INFO L225 Difference]: With dead ends: 6414 [2019-12-07 10:09:40,258 INFO L226 Difference]: Without dead ends: 6042 [2019-12-07 10:09:40,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-07 10:09:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-07 10:09:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-07 10:09:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-12-07 10:09:40,485 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-12-07 10:09:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:40,485 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-12-07 10:09:40,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-12-07 10:09:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:09:40,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:40,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:40,488 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:40,488 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-12-07 10:09:40,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:40,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453966690] [2019-12-07 10:09:40,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:40,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453966690] [2019-12-07 10:09:40,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:40,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:40,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879382121] [2019-12-07 10:09:40,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:40,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:40,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:40,548 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 4 states. [2019-12-07 10:09:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:40,779 INFO L93 Difference]: Finished difference Result 9128 states and 29363 transitions. [2019-12-07 10:09:40,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:09:40,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:09:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:40,835 INFO L225 Difference]: With dead ends: 9128 [2019-12-07 10:09:40,836 INFO L226 Difference]: Without dead ends: 9113 [2019-12-07 10:09:40,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2019-12-07 10:09:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 8369. [2019-12-07 10:09:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-12-07 10:09:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 27318 transitions. [2019-12-07 10:09:41,072 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 27318 transitions. Word has length 11 [2019-12-07 10:09:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:41,073 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 27318 transitions. [2019-12-07 10:09:41,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 27318 transitions. [2019-12-07 10:09:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:09:41,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:41,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:41,077 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:41,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-12-07 10:09:41,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:41,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167996400] [2019-12-07 10:09:41,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:41,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167996400] [2019-12-07 10:09:41,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:41,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:41,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437041830] [2019-12-07 10:09:41,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:41,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:41,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:41,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:41,111 INFO L87 Difference]: Start difference. First operand 8369 states and 27318 transitions. Second operand 3 states. [2019-12-07 10:09:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:41,189 INFO L93 Difference]: Finished difference Result 11252 states and 36788 transitions. [2019-12-07 10:09:41,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:41,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 10:09:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:41,227 INFO L225 Difference]: With dead ends: 11252 [2019-12-07 10:09:41,227 INFO L226 Difference]: Without dead ends: 11252 [2019-12-07 10:09:41,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11252 states. [2019-12-07 10:09:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11252 to 9819. [2019-12-07 10:09:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-12-07 10:09:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32327 transitions. [2019-12-07 10:09:41,428 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32327 transitions. Word has length 14 [2019-12-07 10:09:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:41,429 INFO L462 AbstractCegarLoop]: Abstraction has 9819 states and 32327 transitions. [2019-12-07 10:09:41,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32327 transitions. [2019-12-07 10:09:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:09:41,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:41,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:41,431 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:41,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:41,431 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-12-07 10:09:41,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:41,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109834147] [2019-12-07 10:09:41,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:41,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109834147] [2019-12-07 10:09:41,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:41,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:41,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235472150] [2019-12-07 10:09:41,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:41,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:41,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:41,474 INFO L87 Difference]: Start difference. First operand 9819 states and 32327 transitions. Second operand 4 states. [2019-12-07 10:09:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:41,600 INFO L93 Difference]: Finished difference Result 11915 states and 38297 transitions. [2019-12-07 10:09:41,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:09:41,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:09:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:41,619 INFO L225 Difference]: With dead ends: 11915 [2019-12-07 10:09:41,619 INFO L226 Difference]: Without dead ends: 11904 [2019-12-07 10:09:41,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11904 states. [2019-12-07 10:09:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11904 to 10744. [2019-12-07 10:09:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-12-07 10:09:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 35020 transitions. [2019-12-07 10:09:41,822 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 35020 transitions. Word has length 14 [2019-12-07 10:09:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:41,823 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 35020 transitions. [2019-12-07 10:09:41,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 35020 transitions. [2019-12-07 10:09:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:09:41,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:41,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:41,825 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:41,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-12-07 10:09:41,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:41,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54417123] [2019-12-07 10:09:41,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:41,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54417123] [2019-12-07 10:09:41,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:41,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:41,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137617249] [2019-12-07 10:09:41,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:41,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:41,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:41,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:41,872 INFO L87 Difference]: Start difference. First operand 10744 states and 35020 transitions. Second operand 4 states. [2019-12-07 10:09:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:42,032 INFO L93 Difference]: Finished difference Result 12870 states and 41385 transitions. [2019-12-07 10:09:42,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:09:42,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:09:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:42,051 INFO L225 Difference]: With dead ends: 12870 [2019-12-07 10:09:42,051 INFO L226 Difference]: Without dead ends: 12857 [2019-12-07 10:09:42,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12857 states. [2019-12-07 10:09:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12857 to 10870. [2019-12-07 10:09:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10870 states. [2019-12-07 10:09:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10870 states to 10870 states and 35539 transitions. [2019-12-07 10:09:42,223 INFO L78 Accepts]: Start accepts. Automaton has 10870 states and 35539 transitions. Word has length 14 [2019-12-07 10:09:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:42,223 INFO L462 AbstractCegarLoop]: Abstraction has 10870 states and 35539 transitions. [2019-12-07 10:09:42,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10870 states and 35539 transitions. [2019-12-07 10:09:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:09:42,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:42,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:42,226 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:42,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:42,226 INFO L82 PathProgramCache]: Analyzing trace with hash -133127032, now seen corresponding path program 1 times [2019-12-07 10:09:42,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:42,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065314764] [2019-12-07 10:09:42,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:42,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065314764] [2019-12-07 10:09:42,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:42,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:09:42,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205037930] [2019-12-07 10:09:42,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:42,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:42,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:42,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:42,302 INFO L87 Difference]: Start difference. First operand 10870 states and 35539 transitions. Second operand 3 states. [2019-12-07 10:09:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:42,347 INFO L93 Difference]: Finished difference Result 10914 states and 35611 transitions. [2019-12-07 10:09:42,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:42,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:09:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:42,365 INFO L225 Difference]: With dead ends: 10914 [2019-12-07 10:09:42,366 INFO L226 Difference]: Without dead ends: 10914 [2019-12-07 10:09:42,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10914 states. [2019-12-07 10:09:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10914 to 10867. [2019-12-07 10:09:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10867 states. [2019-12-07 10:09:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 35530 transitions. [2019-12-07 10:09:42,538 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 35530 transitions. Word has length 16 [2019-12-07 10:09:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:42,538 INFO L462 AbstractCegarLoop]: Abstraction has 10867 states and 35530 transitions. [2019-12-07 10:09:42,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 35530 transitions. [2019-12-07 10:09:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:09:42,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:42,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:42,542 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:42,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:42,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1519842378, now seen corresponding path program 1 times [2019-12-07 10:09:42,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:42,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154978950] [2019-12-07 10:09:42,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:42,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154978950] [2019-12-07 10:09:42,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:42,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:42,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78958263] [2019-12-07 10:09:42,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:42,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:42,569 INFO L87 Difference]: Start difference. First operand 10867 states and 35530 transitions. Second operand 3 states. [2019-12-07 10:09:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:42,581 INFO L93 Difference]: Finished difference Result 1664 states and 4070 transitions. [2019-12-07 10:09:42,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:42,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 10:09:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:42,583 INFO L225 Difference]: With dead ends: 1664 [2019-12-07 10:09:42,583 INFO L226 Difference]: Without dead ends: 1664 [2019-12-07 10:09:42,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-12-07 10:09:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-12-07 10:09:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-12-07 10:09:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4070 transitions. [2019-12-07 10:09:42,600 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 4070 transitions. Word has length 17 [2019-12-07 10:09:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:42,600 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 4070 transitions. [2019-12-07 10:09:42,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 4070 transitions. [2019-12-07 10:09:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:09:42,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:42,602 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] [2019-12-07 10:09:42,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:42,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-12-07 10:09:42,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:42,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059585547] [2019-12-07 10:09:42,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:42,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059585547] [2019-12-07 10:09:42,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:42,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:42,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512610486] [2019-12-07 10:09:42,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:42,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:42,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:42,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:42,680 INFO L87 Difference]: Start difference. First operand 1664 states and 4070 transitions. Second operand 5 states. [2019-12-07 10:09:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:42,795 INFO L93 Difference]: Finished difference Result 2291 states and 5479 transitions. [2019-12-07 10:09:42,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:09:42,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 10:09:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:42,798 INFO L225 Difference]: With dead ends: 2291 [2019-12-07 10:09:42,798 INFO L226 Difference]: Without dead ends: 2289 [2019-12-07 10:09:42,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:09:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-12-07 10:09:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1836. [2019-12-07 10:09:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-12-07 10:09:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4456 transitions. [2019-12-07 10:09:42,819 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4456 transitions. Word has length 26 [2019-12-07 10:09:42,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:42,819 INFO L462 AbstractCegarLoop]: Abstraction has 1836 states and 4456 transitions. [2019-12-07 10:09:42,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:09:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4456 transitions. [2019-12-07 10:09:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:09:42,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:42,821 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] [2019-12-07 10:09:42,821 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:42,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:42,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2141135354, now seen corresponding path program 1 times [2019-12-07 10:09:42,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:42,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849440523] [2019-12-07 10:09:42,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:42,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849440523] [2019-12-07 10:09:42,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:42,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:09:42,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76048931] [2019-12-07 10:09:42,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:42,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:42,870 INFO L87 Difference]: Start difference. First operand 1836 states and 4456 transitions. Second operand 5 states. [2019-12-07 10:09:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:43,103 INFO L93 Difference]: Finished difference Result 2650 states and 6314 transitions. [2019-12-07 10:09:43,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:09:43,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 10:09:43,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:43,105 INFO L225 Difference]: With dead ends: 2650 [2019-12-07 10:09:43,106 INFO L226 Difference]: Without dead ends: 2650 [2019-12-07 10:09:43,106 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 10:09:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2019-12-07 10:09:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2252. [2019-12-07 10:09:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2252 states. [2019-12-07 10:09:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 5409 transitions. [2019-12-07 10:09:43,127 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 5409 transitions. Word has length 26 [2019-12-07 10:09:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:43,128 INFO L462 AbstractCegarLoop]: Abstraction has 2252 states and 5409 transitions. [2019-12-07 10:09:43,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:09:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 5409 transitions. [2019-12-07 10:09:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:09:43,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:43,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:43,131 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:43,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash 225797087, now seen corresponding path program 1 times [2019-12-07 10:09:43,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:43,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752200886] [2019-12-07 10:09:43,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:43,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752200886] [2019-12-07 10:09:43,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:43,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:43,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777678749] [2019-12-07 10:09:43,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:43,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:43,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:43,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:43,180 INFO L87 Difference]: Start difference. First operand 2252 states and 5409 transitions. Second operand 5 states. [2019-12-07 10:09:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:43,299 INFO L93 Difference]: Finished difference Result 2774 states and 6566 transitions. [2019-12-07 10:09:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:09:43,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 10:09:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:43,301 INFO L225 Difference]: With dead ends: 2774 [2019-12-07 10:09:43,301 INFO L226 Difference]: Without dead ends: 2772 [2019-12-07 10:09:43,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:09:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-12-07 10:09:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2152. [2019-12-07 10:09:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-07 10:09:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 5178 transitions. [2019-12-07 10:09:43,332 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 5178 transitions. Word has length 27 [2019-12-07 10:09:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:43,332 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 5178 transitions. [2019-12-07 10:09:43,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:09:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 5178 transitions. [2019-12-07 10:09:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:09:43,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:43,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:43,335 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:43,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1661250727, now seen corresponding path program 1 times [2019-12-07 10:09:43,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:43,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775557133] [2019-12-07 10:09:43,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:43,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775557133] [2019-12-07 10:09:43,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:43,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:43,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61376106] [2019-12-07 10:09:43,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:43,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:43,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:43,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:43,375 INFO L87 Difference]: Start difference. First operand 2152 states and 5178 transitions. Second operand 4 states. [2019-12-07 10:09:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:43,388 INFO L93 Difference]: Finished difference Result 1048 states and 2349 transitions. [2019-12-07 10:09:43,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:09:43,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 10:09:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:43,389 INFO L225 Difference]: With dead ends: 1048 [2019-12-07 10:09:43,389 INFO L226 Difference]: Without dead ends: 1048 [2019-12-07 10:09:43,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-07 10:09:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 945. [2019-12-07 10:09:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-12-07 10:09:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2144 transitions. [2019-12-07 10:09:43,398 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2144 transitions. Word has length 27 [2019-12-07 10:09:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:43,398 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 2144 transitions. [2019-12-07 10:09:43,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2144 transitions. [2019-12-07 10:09:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:09:43,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:43,400 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 10:09:43,400 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash -310616313, now seen corresponding path program 1 times [2019-12-07 10:09:43,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:43,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539582677] [2019-12-07 10:09:43,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:43,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539582677] [2019-12-07 10:09:43,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:43,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:09:43,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584957130] [2019-12-07 10:09:43,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:09:43,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:43,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:09:43,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:09:43,466 INFO L87 Difference]: Start difference. First operand 945 states and 2144 transitions. Second operand 6 states. [2019-12-07 10:09:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:43,752 INFO L93 Difference]: Finished difference Result 1244 states and 2733 transitions. [2019-12-07 10:09:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:09:43,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 10:09:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:43,753 INFO L225 Difference]: With dead ends: 1244 [2019-12-07 10:09:43,753 INFO L226 Difference]: Without dead ends: 1244 [2019-12-07 10:09:43,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:09:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-12-07 10:09:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 980. [2019-12-07 10:09:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-07 10:09:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2214 transitions. [2019-12-07 10:09:43,763 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2214 transitions. Word has length 41 [2019-12-07 10:09:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:43,763 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 2214 transitions. [2019-12-07 10:09:43,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:09:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2214 transitions. [2019-12-07 10:09:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:09:43,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:43,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] [2019-12-07 10:09:43,765 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash 372989159, now seen corresponding path program 2 times [2019-12-07 10:09:43,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:43,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376772475] [2019-12-07 10:09:43,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:43,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376772475] [2019-12-07 10:09:43,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:43,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:43,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127459456] [2019-12-07 10:09:43,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:43,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:43,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:43,802 INFO L87 Difference]: Start difference. First operand 980 states and 2214 transitions. Second operand 3 states. [2019-12-07 10:09:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:43,811 INFO L93 Difference]: Finished difference Result 978 states and 2209 transitions. [2019-12-07 10:09:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:43,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 10:09:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:43,812 INFO L225 Difference]: With dead ends: 978 [2019-12-07 10:09:43,812 INFO L226 Difference]: Without dead ends: 978 [2019-12-07 10:09:43,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-12-07 10:09:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 907. [2019-12-07 10:09:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-12-07 10:09:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2072 transitions. [2019-12-07 10:09:43,821 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2072 transitions. Word has length 41 [2019-12-07 10:09:43,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:43,821 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 2072 transitions. [2019-12-07 10:09:43,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2072 transitions. [2019-12-07 10:09:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:09:43,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:43,822 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] [2019-12-07 10:09:43,822 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1722201146, now seen corresponding path program 1 times [2019-12-07 10:09:43,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:43,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110187897] [2019-12-07 10:09:43,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:43,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110187897] [2019-12-07 10:09:43,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:43,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:43,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189226169] [2019-12-07 10:09:43,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:43,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:43,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:43,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:43,861 INFO L87 Difference]: Start difference. First operand 907 states and 2072 transitions. Second operand 4 states. [2019-12-07 10:09:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:43,874 INFO L93 Difference]: Finished difference Result 1563 states and 3600 transitions. [2019-12-07 10:09:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:09:43,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 10:09:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:43,875 INFO L225 Difference]: With dead ends: 1563 [2019-12-07 10:09:43,875 INFO L226 Difference]: Without dead ends: 684 [2019-12-07 10:09:43,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-12-07 10:09:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2019-12-07 10:09:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-12-07 10:09:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1576 transitions. [2019-12-07 10:09:43,882 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1576 transitions. Word has length 42 [2019-12-07 10:09:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:43,882 INFO L462 AbstractCegarLoop]: Abstraction has 684 states and 1576 transitions. [2019-12-07 10:09:43,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1576 transitions. [2019-12-07 10:09:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:09:43,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:43,883 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] [2019-12-07 10:09:43,883 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash -146556572, now seen corresponding path program 2 times [2019-12-07 10:09:43,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:43,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942249246] [2019-12-07 10:09:43,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:43,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942249246] [2019-12-07 10:09:43,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:43,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:09:43,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395827274] [2019-12-07 10:09:43,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:09:43,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:43,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:09:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:09:43,936 INFO L87 Difference]: Start difference. First operand 684 states and 1576 transitions. Second operand 7 states. [2019-12-07 10:09:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:44,047 INFO L93 Difference]: Finished difference Result 1118 states and 2505 transitions. [2019-12-07 10:09:44,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:09:44,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 10:09:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:44,048 INFO L225 Difference]: With dead ends: 1118 [2019-12-07 10:09:44,048 INFO L226 Difference]: Without dead ends: 737 [2019-12-07 10:09:44,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:09:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-07 10:09:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 695. [2019-12-07 10:09:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-12-07 10:09:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1581 transitions. [2019-12-07 10:09:44,055 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1581 transitions. Word has length 42 [2019-12-07 10:09:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:44,055 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1581 transitions. [2019-12-07 10:09:44,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:09:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1581 transitions. [2019-12-07 10:09:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:09:44,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:44,056 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] [2019-12-07 10:09:44,057 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:44,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 3 times [2019-12-07 10:09:44,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:44,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673729773] [2019-12-07 10:09:44,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:09:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:09:44,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:09:44,111 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:09:44,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= |v_ULTIMATE.start_main_~#t843~0.offset_26| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t843~0.base_37| 4)) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37|) |v_ULTIMATE.start_main_~#t843~0.offset_26| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37|)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t843~0.base_37|) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37| 1)) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_main_~#t843~0.base=|v_ULTIMATE.start_main_~#t843~0.base_37|, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ULTIMATE.start_main_~#t843~0.offset=|v_ULTIMATE.start_main_~#t843~0.offset_26|, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t844~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t843~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t844~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t843~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:09:44,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t844~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t844~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t844~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12|) |v_ULTIMATE.start_main_~#t844~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t844~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t844~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t844~0.base] because there is no mapped edge [2019-12-07 10:09:44,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~y$r_buff0_thd2~0_Out-500120729 1) (= ~a~0_In-500120729 ~__unbuffered_p1_EBX~0_Out-500120729) (= ~z~0_Out-500120729 1) (= ~y$r_buff0_thd1~0_In-500120729 ~y$r_buff1_thd1~0_Out-500120729) (= ~y$r_buff1_thd0~0_Out-500120729 ~y$r_buff0_thd0~0_In-500120729) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-500120729 0)) (= ~y$r_buff1_thd2~0_Out-500120729 ~y$r_buff0_thd2~0_In-500120729) (= ~z~0_Out-500120729 ~__unbuffered_p1_EAX~0_Out-500120729)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-500120729, ~a~0=~a~0_In-500120729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-500120729, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-500120729, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-500120729} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-500120729, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-500120729, ~a~0=~a~0_In-500120729, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-500120729, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-500120729, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-500120729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-500120729, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-500120729, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-500120729, ~z~0=~z~0_Out-500120729, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-500120729} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:09:44,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1880070624 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1880070624 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1880070624| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1880070624| ~y$w_buff0_used~0_In-1880070624) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1880070624, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1880070624} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1880070624, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1880070624, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1880070624|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:09:44,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1570265360 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1570265360 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1570265360 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1570265360 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite29_Out1570265360| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out1570265360| ~y$w_buff1_used~0_In1570265360)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570265360, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570265360, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570265360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570265360} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570265360, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1570265360|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570265360, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570265360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570265360} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 10:09:44,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 10:09:44,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2035510359 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2035510359 256)))) (or (= (mod ~y$w_buff0_used~0_In-2035510359 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-2035510359 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2035510359 256))))) (= ~y$r_buff1_thd1~0_In-2035510359 |P0Thread1of1ForFork0_#t~ite23_Out-2035510359|) .cse1 (= |P0Thread1of1ForFork0_#t~ite24_Out-2035510359| |P0Thread1of1ForFork0_#t~ite23_Out-2035510359|)) (and (= ~y$r_buff1_thd1~0_In-2035510359 |P0Thread1of1ForFork0_#t~ite24_Out-2035510359|) (= |P0Thread1of1ForFork0_#t~ite23_In-2035510359| |P0Thread1of1ForFork0_#t~ite23_Out-2035510359|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2035510359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2035510359, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2035510359, ~weak$$choice2~0=~weak$$choice2~0_In-2035510359, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035510359, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-2035510359|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2035510359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2035510359, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2035510359, ~weak$$choice2~0=~weak$$choice2~0_In-2035510359, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-2035510359|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-2035510359|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035510359} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 10:09:44,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:09:44,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= ~y$r_buff0_thd2~0_In1022553106 ~y$r_buff0_thd2~0_Out1022553106)) (.cse2 (= (mod ~y$w_buff0_used~0_In1022553106 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1022553106 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~y$r_buff0_thd2~0_Out1022553106 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1022553106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1022553106} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1022553106|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1022553106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1022553106} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:09:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1435397386 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1435397386 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1435397386 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1435397386 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out1435397386|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In1435397386 |P1Thread1of1ForFork1_#t~ite31_Out1435397386|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1435397386, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1435397386, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1435397386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1435397386} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1435397386, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1435397386, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1435397386|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1435397386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1435397386} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 10:09:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:09:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:09:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-600547366 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-600547366 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-600547366 |ULTIMATE.start_main_#t~ite34_Out-600547366|)) (and (= |ULTIMATE.start_main_#t~ite34_Out-600547366| ~y$w_buff1~0_In-600547366) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-600547366, ~y~0=~y~0_In-600547366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-600547366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-600547366} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-600547366, ~y~0=~y~0_In-600547366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-600547366, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-600547366|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-600547366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 10:09:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 10:09:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In116493803 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In116493803 256)))) (or (and (= ~y$w_buff0_used~0_In116493803 |ULTIMATE.start_main_#t~ite36_Out116493803|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out116493803|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In116493803, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116493803} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In116493803, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116493803, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out116493803|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 10:09:44,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-622942102 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-622942102 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-622942102 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-622942102 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-622942102|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-622942102 |ULTIMATE.start_main_#t~ite37_Out-622942102|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-622942102, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622942102, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622942102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622942102} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-622942102, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622942102, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-622942102|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622942102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622942102} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:09:44,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In713059068 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In713059068 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out713059068| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out713059068| ~y$r_buff0_thd0~0_In713059068)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In713059068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In713059068} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In713059068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In713059068, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out713059068|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:09:44,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-789154248 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-789154248 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-789154248 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-789154248 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-789154248|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-789154248 |ULTIMATE.start_main_#t~ite39_Out-789154248|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-789154248, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-789154248, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-789154248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-789154248} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-789154248, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-789154248|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-789154248, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-789154248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-789154248} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:09:44,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, 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~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:09:44,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:09:44 BasicIcfg [2019-12-07 10:09:44,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:09:44,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:09:44,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:09:44,162 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:09:44,162 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:09:36" (3/4) ... [2019-12-07 10:09:44,164 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:09:44,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= |v_ULTIMATE.start_main_~#t843~0.offset_26| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t843~0.base_37| 4)) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37|) |v_ULTIMATE.start_main_~#t843~0.offset_26| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37|)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t843~0.base_37|) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37| 1)) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_main_~#t843~0.base=|v_ULTIMATE.start_main_~#t843~0.base_37|, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ULTIMATE.start_main_~#t843~0.offset=|v_ULTIMATE.start_main_~#t843~0.offset_26|, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t844~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t843~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t844~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t843~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:09:44,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t844~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t844~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t844~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12|) |v_ULTIMATE.start_main_~#t844~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t844~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t844~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t844~0.base] because there is no mapped edge [2019-12-07 10:09:44,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~y$r_buff0_thd2~0_Out-500120729 1) (= ~a~0_In-500120729 ~__unbuffered_p1_EBX~0_Out-500120729) (= ~z~0_Out-500120729 1) (= ~y$r_buff0_thd1~0_In-500120729 ~y$r_buff1_thd1~0_Out-500120729) (= ~y$r_buff1_thd0~0_Out-500120729 ~y$r_buff0_thd0~0_In-500120729) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-500120729 0)) (= ~y$r_buff1_thd2~0_Out-500120729 ~y$r_buff0_thd2~0_In-500120729) (= ~z~0_Out-500120729 ~__unbuffered_p1_EAX~0_Out-500120729)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-500120729, ~a~0=~a~0_In-500120729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-500120729, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-500120729, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-500120729} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-500120729, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-500120729, ~a~0=~a~0_In-500120729, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-500120729, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-500120729, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-500120729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-500120729, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-500120729, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-500120729, ~z~0=~z~0_Out-500120729, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-500120729} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:09:44,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1880070624 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1880070624 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1880070624| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1880070624| ~y$w_buff0_used~0_In-1880070624) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1880070624, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1880070624} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1880070624, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1880070624, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1880070624|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:09:44,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1570265360 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1570265360 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1570265360 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1570265360 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite29_Out1570265360| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out1570265360| ~y$w_buff1_used~0_In1570265360)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570265360, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570265360, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570265360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570265360} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570265360, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1570265360|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570265360, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570265360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570265360} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 10:09:44,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 10:09:44,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2035510359 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2035510359 256)))) (or (= (mod ~y$w_buff0_used~0_In-2035510359 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-2035510359 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2035510359 256))))) (= ~y$r_buff1_thd1~0_In-2035510359 |P0Thread1of1ForFork0_#t~ite23_Out-2035510359|) .cse1 (= |P0Thread1of1ForFork0_#t~ite24_Out-2035510359| |P0Thread1of1ForFork0_#t~ite23_Out-2035510359|)) (and (= ~y$r_buff1_thd1~0_In-2035510359 |P0Thread1of1ForFork0_#t~ite24_Out-2035510359|) (= |P0Thread1of1ForFork0_#t~ite23_In-2035510359| |P0Thread1of1ForFork0_#t~ite23_Out-2035510359|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2035510359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2035510359, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2035510359, ~weak$$choice2~0=~weak$$choice2~0_In-2035510359, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035510359, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-2035510359|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2035510359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2035510359, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2035510359, ~weak$$choice2~0=~weak$$choice2~0_In-2035510359, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-2035510359|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-2035510359|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035510359} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 10:09:44,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:09:44,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= ~y$r_buff0_thd2~0_In1022553106 ~y$r_buff0_thd2~0_Out1022553106)) (.cse2 (= (mod ~y$w_buff0_used~0_In1022553106 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1022553106 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~y$r_buff0_thd2~0_Out1022553106 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1022553106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1022553106} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1022553106|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1022553106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1022553106} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:09:44,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1435397386 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1435397386 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1435397386 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1435397386 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out1435397386|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In1435397386 |P1Thread1of1ForFork1_#t~ite31_Out1435397386|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1435397386, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1435397386, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1435397386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1435397386} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1435397386, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1435397386, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1435397386|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1435397386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1435397386} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 10:09:44,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:09:44,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:09:44,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-600547366 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-600547366 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-600547366 |ULTIMATE.start_main_#t~ite34_Out-600547366|)) (and (= |ULTIMATE.start_main_#t~ite34_Out-600547366| ~y$w_buff1~0_In-600547366) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-600547366, ~y~0=~y~0_In-600547366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-600547366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-600547366} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-600547366, ~y~0=~y~0_In-600547366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-600547366, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-600547366|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-600547366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 10:09:44,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 10:09:44,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In116493803 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In116493803 256)))) (or (and (= ~y$w_buff0_used~0_In116493803 |ULTIMATE.start_main_#t~ite36_Out116493803|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out116493803|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In116493803, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116493803} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In116493803, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116493803, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out116493803|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 10:09:44,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-622942102 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-622942102 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-622942102 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-622942102 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-622942102|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-622942102 |ULTIMATE.start_main_#t~ite37_Out-622942102|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-622942102, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622942102, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622942102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622942102} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-622942102, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622942102, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-622942102|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622942102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622942102} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:09:44,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In713059068 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In713059068 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out713059068| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out713059068| ~y$r_buff0_thd0~0_In713059068)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In713059068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In713059068} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In713059068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In713059068, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out713059068|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:09:44,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-789154248 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-789154248 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-789154248 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-789154248 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-789154248|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-789154248 |ULTIMATE.start_main_#t~ite39_Out-789154248|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-789154248, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-789154248, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-789154248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-789154248} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-789154248, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-789154248|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-789154248, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-789154248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-789154248} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:09:44,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, 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~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:09:44,221 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_197ee8e2-fe38-4a20-94fe-c035727d6173/bin/uautomizer/witness.graphml [2019-12-07 10:09:44,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:09:44,222 INFO L168 Benchmark]: Toolchain (without parser) took 8539.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.9 MB). Free memory was 935.4 MB in the beginning and 846.7 MB in the end (delta: 88.7 MB). Peak memory consumption was 506.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:44,223 INFO L168 Benchmark]: CDTParser took 0.19 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 10:09:44,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:44,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:44,224 INFO L168 Benchmark]: Boogie Preprocessor took 23.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:09:44,224 INFO L168 Benchmark]: RCFGBuilder took 363.02 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:44,224 INFO L168 Benchmark]: TraceAbstraction took 7618.15 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 1.0 GB in the beginning and 861.6 MB in the end (delta: 144.7 MB). Peak memory consumption was 466.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:44,224 INFO L168 Benchmark]: Witness Printer took 59.78 ms. Allocated memory is still 1.4 GB. Free memory was 861.6 MB in the beginning and 846.7 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:44,226 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.19 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 430.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.72 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 23.91 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 363.02 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7618.15 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 1.0 GB in the beginning and 861.6 MB in the end (delta: 144.7 MB). Peak memory consumption was 466.6 MB. Max. memory is 11.5 GB. * Witness Printer took 59.78 ms. Allocated memory is still 1.4 GB. Free memory was 861.6 MB in the beginning and 846.7 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1708 SDtfs, 1344 SDslu, 2675 SDs, 0 SdLazy, 1514 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10870occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 7322 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 31182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...