/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:33:58,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:33:58,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:33:58,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:33:58,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:33:58,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:33:58,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:33:58,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:33:58,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:33:58,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:33:58,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:33:58,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:33:58,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:33:58,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:33:58,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:33:58,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:33:58,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:33:58,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:33:58,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:33:58,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:33:58,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:33:58,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:33:58,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:33:58,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:33:58,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:33:58,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:33:58,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:33:58,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:33:58,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:33:58,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:33:58,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:33:58,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:33:58,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:33:58,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:33:58,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:33:58,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:33:58,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:33:58,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:33:58,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:33:58,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:33:58,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:33:58,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:33:58,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:33:58,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:33:58,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:33:58,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:33:58,150 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:33:58,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:33:58,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:33:58,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:33:58,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:33:58,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:33:58,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:33:58,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:33:58,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:33:58,151 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:33:58,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:33:58,152 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:33:58,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:33:58,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:33:58,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:33:58,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:33:58,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:33:58,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:33:58,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:33:58,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:33:58,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:33:58,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:33:58,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:33:58,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:33:58,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:33:58,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:33:58,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:33:58,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:33:58,438 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:33:58,438 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:33:58,439 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2019-12-27 02:33:58,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ee36f48/e9fc867c9a1d40ecbe8e3a97bdd578b7/FLAG10f734c2b [2019-12-27 02:33:59,039 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:33:59,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2019-12-27 02:33:59,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ee36f48/e9fc867c9a1d40ecbe8e3a97bdd578b7/FLAG10f734c2b [2019-12-27 02:33:59,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ee36f48/e9fc867c9a1d40ecbe8e3a97bdd578b7 [2019-12-27 02:33:59,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:33:59,389 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:33:59,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:33:59,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:33:59,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:33:59,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:33:59" (1/1) ... [2019-12-27 02:33:59,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2184bb17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:59, skipping insertion in model container [2019-12-27 02:33:59,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:33:59" (1/1) ... [2019-12-27 02:33:59,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:33:59,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:34:00,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:34:00,169 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:34:00,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:34:00,310 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:34:00,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00 WrapperNode [2019-12-27 02:34:00,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:34:00,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:34:00,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:34:00,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:34:00,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... [2019-12-27 02:34:00,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... [2019-12-27 02:34:00,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:34:00,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:34:00,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:34:00,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:34:00,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... [2019-12-27 02:34:00,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... [2019-12-27 02:34:00,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... [2019-12-27 02:34:00,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... [2019-12-27 02:34:00,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... [2019-12-27 02:34:00,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... [2019-12-27 02:34:00,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... [2019-12-27 02:34:00,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:34:00,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:34:00,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:34:00,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:34:00,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 02:34:00,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:34:00,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:34:00,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:34:00,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:34:00,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:34:00,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:34:00,535 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:34:00,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:34:00,535 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:34:00,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:34:00,536 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:34:00,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:34:00,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:34:00,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:34:00,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:34:00,538 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:34:01,309 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:34:01,309 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:34:01,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:34:01 BoogieIcfgContainer [2019-12-27 02:34:01,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:34:01,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:34:01,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:34:01,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:34:01,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:33:59" (1/3) ... [2019-12-27 02:34:01,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6930c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:34:01, skipping insertion in model container [2019-12-27 02:34:01,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:00" (2/3) ... [2019-12-27 02:34:01,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6930c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:34:01, skipping insertion in model container [2019-12-27 02:34:01,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:34:01" (3/3) ... [2019-12-27 02:34:01,320 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_tso.opt.i [2019-12-27 02:34:01,330 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:34:01,331 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:34:01,339 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:34:01,340 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:34:01,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,380 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,380 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,389 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,390 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,390 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,390 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,391 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,418 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,418 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,424 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,425 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,428 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,428 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,431 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,431 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,433 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:34:01,448 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:34:01,470 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:34:01,470 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:34:01,471 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:34:01,471 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:34:01,471 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:34:01,471 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:34:01,471 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:34:01,471 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:34:01,489 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-27 02:34:01,491 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 02:34:01,593 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 02:34:01,594 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:34:01,612 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:34:01,642 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 02:34:01,702 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 02:34:01,702 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:34:01,715 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:34:01,746 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 02:34:01,747 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:34:07,014 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 02:34:07,168 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 02:34:07,193 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-27 02:34:07,193 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-27 02:34:07,197 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 02:34:09,993 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-27 02:34:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-27 02:34:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:34:10,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:10,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:34:10,004 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:10,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:10,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-27 02:34:10,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:10,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208955004] [2019-12-27 02:34:10,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:10,310 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-27 02:34:10,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208955004] [2019-12-27 02:34:10,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:10,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:34:10,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676426043] [2019-12-27 02:34:10,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:34:10,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:34:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:34:10,336 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-27 02:34:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:10,896 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-27 02:34:10,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:34:10,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:34:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:11,457 INFO L225 Difference]: With dead ends: 33638 [2019-12-27 02:34:11,458 INFO L226 Difference]: Without dead ends: 32966 [2019-12-27 02:34:11,459 INFO L631 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-27 02:34:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-27 02:34:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-27 02:34:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-27 02:34:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-27 02:34:13,083 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-27 02:34:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:13,085 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-27 02:34:13,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:34:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-27 02:34:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:34:13,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:13,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:34:13,093 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:13,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:13,094 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-27 02:34:13,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:13,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233790961] [2019-12-27 02:34:13,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:13,222 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-27 02:34:13,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233790961] [2019-12-27 02:34:13,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:13,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:34:13,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518957182] [2019-12-27 02:34:13,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:34:13,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:34:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:34:13,227 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-27 02:34:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:14,977 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-27 02:34:14,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:34:14,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:34:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:15,186 INFO L225 Difference]: With dead ends: 44494 [2019-12-27 02:34:15,187 INFO L226 Difference]: Without dead ends: 44494 [2019-12-27 02:34:15,188 INFO L631 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-27 02:34:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-27 02:34:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-27 02:34:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-27 02:34:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-27 02:34:17,203 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-27 02:34:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:17,203 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-27 02:34:17,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:34:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-27 02:34:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:34:17,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:17,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:34:17,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:17,206 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-27 02:34:17,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:17,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105723127] [2019-12-27 02:34:17,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:17,297 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-27 02:34:17,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105723127] [2019-12-27 02:34:17,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:17,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:34:17,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034042693] [2019-12-27 02:34:17,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:34:17,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:17,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:34:17,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:34:17,300 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-27 02:34:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:19,857 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-27 02:34:19,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:34:19,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:34:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:20,050 INFO L225 Difference]: With dead ends: 62082 [2019-12-27 02:34:20,050 INFO L226 Difference]: Without dead ends: 62054 [2019-12-27 02:34:20,051 INFO L631 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-27 02:34:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-27 02:34:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-27 02:34:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-27 02:34:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-27 02:34:21,508 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-27 02:34:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:21,508 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-27 02:34:21,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:34:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-27 02:34:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:34:21,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:21,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:34:21,522 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:21,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:21,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-27 02:34:21,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:21,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176035150] [2019-12-27 02:34:21,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:21,661 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-27 02:34:21,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176035150] [2019-12-27 02:34:21,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:21,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:34:21,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464170547] [2019-12-27 02:34:21,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:34:21,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:21,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:34:21,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:34:21,663 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-27 02:34:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:22,768 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-27 02:34:22,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:34:22,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 02:34:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:22,983 INFO L225 Difference]: With dead ends: 68854 [2019-12-27 02:34:22,983 INFO L226 Difference]: Without dead ends: 68826 [2019-12-27 02:34:22,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:34:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-27 02:34:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-27 02:34:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-27 02:34:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-27 02:34:27,100 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-27 02:34:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:27,100 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-27 02:34:27,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:34:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-27 02:34:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:34:27,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:27,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:34:27,142 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:27,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-27 02:34:27,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:27,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365495670] [2019-12-27 02:34:27,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:34:27,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365495670] [2019-12-27 02:34:27,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:27,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:34:27,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446118335] [2019-12-27 02:34:27,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:34:27,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:27,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:34:27,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:34:27,209 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-27 02:34:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:27,543 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-27 02:34:27,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:34:27,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 02:34:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:27,700 INFO L225 Difference]: With dead ends: 64130 [2019-12-27 02:34:27,700 INFO L226 Difference]: Without dead ends: 64130 [2019-12-27 02:34:27,701 INFO L631 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-27 02:34:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-27 02:34:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-27 02:34:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-27 02:34:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-27 02:34:31,444 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-27 02:34:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:31,445 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-27 02:34:31,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:34:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-27 02:34:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:34:31,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:31,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:34:31,481 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-27 02:34:31,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:31,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487863497] [2019-12-27 02:34:31,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:31,596 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-27 02:34:31,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487863497] [2019-12-27 02:34:31,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:31,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:34:31,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637803285] [2019-12-27 02:34:31,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:34:31,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:31,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:34:31,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:34:31,600 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-27 02:34:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:32,786 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-27 02:34:32,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:34:32,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 02:34:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:32,998 INFO L225 Difference]: With dead ends: 81602 [2019-12-27 02:34:32,998 INFO L226 Difference]: Without dead ends: 81538 [2019-12-27 02:34:32,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:34:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-27 02:34:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-27 02:34:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-27 02:34:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-27 02:34:35,114 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-27 02:34:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:35,114 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-27 02:34:35,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:34:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-27 02:34:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:34:35,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:35,186 INFO L411 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] [2019-12-27 02:34:35,186 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:35,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:35,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-27 02:34:35,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:35,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654761775] [2019-12-27 02:34:35,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:38,521 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-27 02:34:38,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654761775] [2019-12-27 02:34:38,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:38,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:34:38,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028207207] [2019-12-27 02:34:38,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:34:38,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:38,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:34:38,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:34:38,524 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-27 02:34:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:38,911 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-27 02:34:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:34:38,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-27 02:34:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:39,074 INFO L225 Difference]: With dead ends: 65578 [2019-12-27 02:34:39,074 INFO L226 Difference]: Without dead ends: 65578 [2019-12-27 02:34:39,074 INFO L631 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-27 02:34:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-27 02:34:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-27 02:34:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-27 02:34:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-27 02:34:40,610 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-27 02:34:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:40,610 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-27 02:34:40,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:34:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-27 02:34:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:34:40,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:40,668 INFO L411 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] [2019-12-27 02:34:40,668 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-27 02:34:40,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:40,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119640922] [2019-12-27 02:34:40,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:40,765 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-27 02:34:40,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119640922] [2019-12-27 02:34:40,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:40,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:34:40,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237403480] [2019-12-27 02:34:40,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:34:40,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:40,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:34:40,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:34:40,767 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 7 states. [2019-12-27 02:34:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:42,477 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-27 02:34:42,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:34:42,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 02:34:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:42,712 INFO L225 Difference]: With dead ends: 89414 [2019-12-27 02:34:42,713 INFO L226 Difference]: Without dead ends: 89310 [2019-12-27 02:34:42,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:34:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-27 02:34:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-27 02:34:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-27 02:34:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-27 02:34:47,184 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-27 02:34:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:47,184 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-27 02:34:47,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:34:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-27 02:34:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:34:47,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:47,253 INFO L411 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] [2019-12-27 02:34:47,253 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:47,254 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-27 02:34:47,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:47,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063888152] [2019-12-27 02:34:47,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:47,381 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-27 02:34:47,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063888152] [2019-12-27 02:34:47,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:47,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:34:47,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831151373] [2019-12-27 02:34:47,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:34:47,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:47,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:34:47,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:34:47,385 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 6 states. [2019-12-27 02:34:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:48,133 INFO L93 Difference]: Finished difference Result 74494 states and 310372 transitions. [2019-12-27 02:34:48,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:34:48,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 02:34:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:48,330 INFO L225 Difference]: With dead ends: 74494 [2019-12-27 02:34:48,330 INFO L226 Difference]: Without dead ends: 71114 [2019-12-27 02:34:48,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:34:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71114 states. [2019-12-27 02:34:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71114 to 65978. [2019-12-27 02:34:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65978 states. [2019-12-27 02:34:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65978 states to 65978 states and 274224 transitions. [2019-12-27 02:34:50,337 INFO L78 Accepts]: Start accepts. Automaton has 65978 states and 274224 transitions. Word has length 35 [2019-12-27 02:34:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:50,338 INFO L462 AbstractCegarLoop]: Abstraction has 65978 states and 274224 transitions. [2019-12-27 02:34:50,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:34:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 65978 states and 274224 transitions. [2019-12-27 02:34:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 02:34:50,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:50,405 INFO L411 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] [2019-12-27 02:34:50,405 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817762, now seen corresponding path program 1 times [2019-12-27 02:34:50,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:50,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647259721] [2019-12-27 02:34:50,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:50,597 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-27 02:34:50,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647259721] [2019-12-27 02:34:50,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:50,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:34:50,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657210078] [2019-12-27 02:34:50,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:34:50,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:50,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:34:50,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:34:50,602 INFO L87 Difference]: Start difference. First operand 65978 states and 274224 transitions. Second operand 9 states. [2019-12-27 02:34:52,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:52,544 INFO L93 Difference]: Finished difference Result 118218 states and 493264 transitions. [2019-12-27 02:34:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:34:52,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-27 02:34:52,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:52,824 INFO L225 Difference]: With dead ends: 118218 [2019-12-27 02:34:52,824 INFO L226 Difference]: Without dead ends: 98890 [2019-12-27 02:34:52,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:34:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98890 states. [2019-12-27 02:34:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98890 to 93605. [2019-12-27 02:34:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93605 states. [2019-12-27 02:34:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93605 states to 93605 states and 391402 transitions. [2019-12-27 02:34:58,444 INFO L78 Accepts]: Start accepts. Automaton has 93605 states and 391402 transitions. Word has length 37 [2019-12-27 02:34:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:58,444 INFO L462 AbstractCegarLoop]: Abstraction has 93605 states and 391402 transitions. [2019-12-27 02:34:58,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:34:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 93605 states and 391402 transitions. [2019-12-27 02:34:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 02:34:58,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:58,575 INFO L411 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] [2019-12-27 02:34:58,575 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash -475384636, now seen corresponding path program 1 times [2019-12-27 02:34:58,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:58,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541115300] [2019-12-27 02:34:58,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:58,705 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-27 02:34:58,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541115300] [2019-12-27 02:34:58,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:58,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:34:58,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039270459] [2019-12-27 02:34:58,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:34:58,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:34:58,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:34:58,707 INFO L87 Difference]: Start difference. First operand 93605 states and 391402 transitions. Second operand 10 states. [2019-12-27 02:34:59,698 WARN L192 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-27 02:35:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:00,885 INFO L93 Difference]: Finished difference Result 161816 states and 676008 transitions. [2019-12-27 02:35:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:35:00,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-27 02:35:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:01,296 INFO L225 Difference]: With dead ends: 161816 [2019-12-27 02:35:01,296 INFO L226 Difference]: Without dead ends: 142064 [2019-12-27 02:35:01,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2019-12-27 02:35:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142064 states. [2019-12-27 02:35:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142064 to 87882. [2019-12-27 02:35:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87882 states. [2019-12-27 02:35:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87882 states to 87882 states and 363300 transitions. [2019-12-27 02:35:08,422 INFO L78 Accepts]: Start accepts. Automaton has 87882 states and 363300 transitions. Word has length 38 [2019-12-27 02:35:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:08,423 INFO L462 AbstractCegarLoop]: Abstraction has 87882 states and 363300 transitions. [2019-12-27 02:35:08,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:35:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 87882 states and 363300 transitions. [2019-12-27 02:35:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 02:35:09,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:09,233 INFO L411 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] [2019-12-27 02:35:09,233 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash 438975875, now seen corresponding path program 1 times [2019-12-27 02:35:09,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:09,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947444577] [2019-12-27 02:35:09,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:09,516 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-27 02:35:09,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947444577] [2019-12-27 02:35:09,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:09,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:35:09,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859063444] [2019-12-27 02:35:09,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:35:09,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:09,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:35:09,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:35:09,518 INFO L87 Difference]: Start difference. First operand 87882 states and 363300 transitions. Second operand 9 states. [2019-12-27 02:35:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:10,738 INFO L93 Difference]: Finished difference Result 143634 states and 590844 transitions. [2019-12-27 02:35:10,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:35:10,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 02:35:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:11,157 INFO L225 Difference]: With dead ends: 143634 [2019-12-27 02:35:11,158 INFO L226 Difference]: Without dead ends: 143058 [2019-12-27 02:35:11,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:35:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143058 states. [2019-12-27 02:35:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143058 to 109298. [2019-12-27 02:35:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109298 states. [2019-12-27 02:35:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109298 states to 109298 states and 451140 transitions. [2019-12-27 02:35:14,708 INFO L78 Accepts]: Start accepts. Automaton has 109298 states and 451140 transitions. Word has length 38 [2019-12-27 02:35:14,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:14,709 INFO L462 AbstractCegarLoop]: Abstraction has 109298 states and 451140 transitions. [2019-12-27 02:35:14,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:35:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 109298 states and 451140 transitions. [2019-12-27 02:35:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 02:35:20,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:20,066 INFO L411 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] [2019-12-27 02:35:20,066 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash 322595139, now seen corresponding path program 2 times [2019-12-27 02:35:20,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:20,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736678408] [2019-12-27 02:35:20,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:20,185 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-27 02:35:20,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736678408] [2019-12-27 02:35:20,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:20,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:35:20,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530309821] [2019-12-27 02:35:20,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:35:20,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:20,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:35:20,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:35:20,187 INFO L87 Difference]: Start difference. First operand 109298 states and 451140 transitions. Second operand 6 states. [2019-12-27 02:35:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:20,769 INFO L93 Difference]: Finished difference Result 99858 states and 404296 transitions. [2019-12-27 02:35:20,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:35:20,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-27 02:35:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:21,024 INFO L225 Difference]: With dead ends: 99858 [2019-12-27 02:35:21,025 INFO L226 Difference]: Without dead ends: 94914 [2019-12-27 02:35:21,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:35:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94914 states. [2019-12-27 02:35:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94914 to 70602. [2019-12-27 02:35:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70602 states. [2019-12-27 02:35:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70602 states to 70602 states and 287240 transitions. [2019-12-27 02:35:23,092 INFO L78 Accepts]: Start accepts. Automaton has 70602 states and 287240 transitions. Word has length 38 [2019-12-27 02:35:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:23,093 INFO L462 AbstractCegarLoop]: Abstraction has 70602 states and 287240 transitions. [2019-12-27 02:35:23,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:35:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 70602 states and 287240 transitions. [2019-12-27 02:35:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:35:23,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:23,185 INFO L411 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] [2019-12-27 02:35:23,185 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:23,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:23,185 INFO L82 PathProgramCache]: Analyzing trace with hash 922127842, now seen corresponding path program 1 times [2019-12-27 02:35:23,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:23,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850561346] [2019-12-27 02:35:23,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:23,250 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-27 02:35:23,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850561346] [2019-12-27 02:35:23,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:23,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:35:23,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429231744] [2019-12-27 02:35:23,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:35:23,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:23,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:35:23,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:35:23,253 INFO L87 Difference]: Start difference. First operand 70602 states and 287240 transitions. Second operand 4 states. [2019-12-27 02:35:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:23,611 INFO L93 Difference]: Finished difference Result 56189 states and 209974 transitions. [2019-12-27 02:35:23,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:35:23,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 02:35:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:23,762 INFO L225 Difference]: With dead ends: 56189 [2019-12-27 02:35:23,762 INFO L226 Difference]: Without dead ends: 54953 [2019-12-27 02:35:23,763 INFO L631 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-27 02:35:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54953 states. [2019-12-27 02:35:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54953 to 54953. [2019-12-27 02:35:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54953 states. [2019-12-27 02:35:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54953 states to 54953 states and 206070 transitions. [2019-12-27 02:35:25,436 INFO L78 Accepts]: Start accepts. Automaton has 54953 states and 206070 transitions. Word has length 39 [2019-12-27 02:35:25,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:25,436 INFO L462 AbstractCegarLoop]: Abstraction has 54953 states and 206070 transitions. [2019-12-27 02:35:25,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:35:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 54953 states and 206070 transitions. [2019-12-27 02:35:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:35:25,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:25,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:35:25,496 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1151366660, now seen corresponding path program 1 times [2019-12-27 02:35:25,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:25,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306178737] [2019-12-27 02:35:25,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:25,571 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-27 02:35:25,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306178737] [2019-12-27 02:35:25,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:25,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:35:25,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154454261] [2019-12-27 02:35:25,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:35:25,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:25,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:35:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:35:25,573 INFO L87 Difference]: Start difference. First operand 54953 states and 206070 transitions. Second operand 6 states. [2019-12-27 02:35:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:26,041 INFO L93 Difference]: Finished difference Result 80618 states and 296201 transitions. [2019-12-27 02:35:26,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:35:26,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 02:35:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:26,143 INFO L225 Difference]: With dead ends: 80618 [2019-12-27 02:35:26,143 INFO L226 Difference]: Without dead ends: 45650 [2019-12-27 02:35:26,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:35:26,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45650 states. [2019-12-27 02:35:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45650 to 45650. [2019-12-27 02:35:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45650 states. [2019-12-27 02:35:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45650 states to 45650 states and 168568 transitions. [2019-12-27 02:35:27,795 INFO L78 Accepts]: Start accepts. Automaton has 45650 states and 168568 transitions. Word has length 40 [2019-12-27 02:35:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:27,796 INFO L462 AbstractCegarLoop]: Abstraction has 45650 states and 168568 transitions. [2019-12-27 02:35:27,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:35:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 45650 states and 168568 transitions. [2019-12-27 02:35:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:35:27,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:27,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:35:27,844 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:27,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash 71622762, now seen corresponding path program 2 times [2019-12-27 02:35:27,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:27,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104639744] [2019-12-27 02:35:27,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:27,918 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-27 02:35:27,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104639744] [2019-12-27 02:35:27,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:27,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:35:27,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42177387] [2019-12-27 02:35:27,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:35:27,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:27,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:35:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:35:27,921 INFO L87 Difference]: Start difference. First operand 45650 states and 168568 transitions. Second operand 5 states. [2019-12-27 02:35:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:28,040 INFO L93 Difference]: Finished difference Result 16116 states and 50186 transitions. [2019-12-27 02:35:28,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:35:28,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:35:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:28,072 INFO L225 Difference]: With dead ends: 16116 [2019-12-27 02:35:28,073 INFO L226 Difference]: Without dead ends: 15210 [2019-12-27 02:35:28,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:35:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15210 states. [2019-12-27 02:35:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15210 to 15210. [2019-12-27 02:35:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15210 states. [2019-12-27 02:35:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15210 states to 15210 states and 47288 transitions. [2019-12-27 02:35:28,304 INFO L78 Accepts]: Start accepts. Automaton has 15210 states and 47288 transitions. Word has length 40 [2019-12-27 02:35:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:28,304 INFO L462 AbstractCegarLoop]: Abstraction has 15210 states and 47288 transitions. [2019-12-27 02:35:28,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:35:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15210 states and 47288 transitions. [2019-12-27 02:35:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:35:28,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:28,315 INFO L411 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-27 02:35:28,315 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1368489979, now seen corresponding path program 1 times [2019-12-27 02:35:28,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:28,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27493943] [2019-12-27 02:35:28,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:28,381 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-27 02:35:28,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27493943] [2019-12-27 02:35:28,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:28,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:35:28,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880818591] [2019-12-27 02:35:28,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:35:28,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:28,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:35:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:35:28,383 INFO L87 Difference]: Start difference. First operand 15210 states and 47288 transitions. Second operand 6 states. [2019-12-27 02:35:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:28,455 INFO L93 Difference]: Finished difference Result 3276 states and 8262 transitions. [2019-12-27 02:35:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:35:28,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 02:35:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:28,459 INFO L225 Difference]: With dead ends: 3276 [2019-12-27 02:35:28,459 INFO L226 Difference]: Without dead ends: 2905 [2019-12-27 02:35:28,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:35:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2019-12-27 02:35:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2905. [2019-12-27 02:35:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2019-12-27 02:35:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 7214 transitions. [2019-12-27 02:35:28,487 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 7214 transitions. Word has length 41 [2019-12-27 02:35:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:28,487 INFO L462 AbstractCegarLoop]: Abstraction has 2905 states and 7214 transitions. [2019-12-27 02:35:28,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:35:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 7214 transitions. [2019-12-27 02:35:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:35:28,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:28,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:35:28,491 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-27 02:35:28,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:28,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315885025] [2019-12-27 02:35:28,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:28,596 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-27 02:35:28,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315885025] [2019-12-27 02:35:28,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:28,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:35:28,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246496546] [2019-12-27 02:35:28,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:35:28,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:28,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:35:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:35:28,602 INFO L87 Difference]: Start difference. First operand 2905 states and 7214 transitions. Second operand 7 states. [2019-12-27 02:35:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:28,695 INFO L93 Difference]: Finished difference Result 1340 states and 3713 transitions. [2019-12-27 02:35:28,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:35:28,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 02:35:28,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:28,698 INFO L225 Difference]: With dead ends: 1340 [2019-12-27 02:35:28,698 INFO L226 Difference]: Without dead ends: 1290 [2019-12-27 02:35:28,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:35:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-12-27 02:35:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1050. [2019-12-27 02:35:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-12-27 02:35:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2894 transitions. [2019-12-27 02:35:28,711 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2894 transitions. Word has length 48 [2019-12-27 02:35:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:28,712 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2894 transitions. [2019-12-27 02:35:28,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:35:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2894 transitions. [2019-12-27 02:35:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 02:35:28,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:28,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:35:28,713 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-27 02:35:28,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:28,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670997141] [2019-12-27 02:35:28,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:28,765 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-27 02:35:28,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670997141] [2019-12-27 02:35:28,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:28,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:35:28,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70745949] [2019-12-27 02:35:28,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:35:28,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:28,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:35:28,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:35:28,767 INFO L87 Difference]: Start difference. First operand 1050 states and 2894 transitions. Second operand 3 states. [2019-12-27 02:35:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:28,782 INFO L93 Difference]: Finished difference Result 1004 states and 2711 transitions. [2019-12-27 02:35:28,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:35:28,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 02:35:28,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:28,784 INFO L225 Difference]: With dead ends: 1004 [2019-12-27 02:35:28,785 INFO L226 Difference]: Without dead ends: 1004 [2019-12-27 02:35:28,785 INFO L631 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-27 02:35:28,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-27 02:35:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2019-12-27 02:35:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-12-27 02:35:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 2711 transitions. [2019-12-27 02:35:28,801 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 2711 transitions. Word has length 59 [2019-12-27 02:35:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:28,802 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 2711 transitions. [2019-12-27 02:35:28,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:35:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 2711 transitions. [2019-12-27 02:35:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:35:28,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:28,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:35:28,804 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:28,804 INFO L82 PathProgramCache]: Analyzing trace with hash -311204278, now seen corresponding path program 1 times [2019-12-27 02:35:28,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:28,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920108113] [2019-12-27 02:35:28,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:29,069 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-27 02:35:29,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920108113] [2019-12-27 02:35:29,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:29,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:35:29,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608704202] [2019-12-27 02:35:29,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:35:29,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:35:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:35:29,073 INFO L87 Difference]: Start difference. First operand 1004 states and 2711 transitions. Second operand 13 states. [2019-12-27 02:35:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:29,467 INFO L93 Difference]: Finished difference Result 1459 states and 3920 transitions. [2019-12-27 02:35:29,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 02:35:29,467 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 02:35:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:29,469 INFO L225 Difference]: With dead ends: 1459 [2019-12-27 02:35:29,469 INFO L226 Difference]: Without dead ends: 972 [2019-12-27 02:35:29,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:35:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-12-27 02:35:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2019-12-27 02:35:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-12-27 02:35:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 2611 transitions. [2019-12-27 02:35:29,484 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 2611 transitions. Word has length 60 [2019-12-27 02:35:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:29,484 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 2611 transitions. [2019-12-27 02:35:29,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:35:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 2611 transitions. [2019-12-27 02:35:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:35:29,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:29,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:35:29,487 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:29,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:29,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1121095450, now seen corresponding path program 2 times [2019-12-27 02:35:29,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:29,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119315657] [2019-12-27 02:35:29,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:29,618 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-27 02:35:29,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119315657] [2019-12-27 02:35:29,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:29,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:35:29,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256215989] [2019-12-27 02:35:29,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:35:29,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:29,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:35:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:35:29,621 INFO L87 Difference]: Start difference. First operand 972 states and 2611 transitions. Second operand 7 states. [2019-12-27 02:35:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:29,755 INFO L93 Difference]: Finished difference Result 1511 states and 3816 transitions. [2019-12-27 02:35:29,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:35:29,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 02:35:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:29,757 INFO L225 Difference]: With dead ends: 1511 [2019-12-27 02:35:29,757 INFO L226 Difference]: Without dead ends: 550 [2019-12-27 02:35:29,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:35:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-12-27 02:35:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 532. [2019-12-27 02:35:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-27 02:35:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1146 transitions. [2019-12-27 02:35:29,766 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1146 transitions. Word has length 60 [2019-12-27 02:35:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:29,766 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 1146 transitions. [2019-12-27 02:35:29,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:35:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1146 transitions. [2019-12-27 02:35:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:35:29,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:29,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:35:29,768 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 3 times [2019-12-27 02:35:29,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:29,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986345855] [2019-12-27 02:35:29,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:35:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:35:29,878 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:35:29,879 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:35:29,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1157~0.base_21| 4) |v_#length_27|) (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1157~0.base_21|) 0) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1157~0.base_21| 1)) (= v_~z$r_buff0_thd2~0_135 0) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1157~0.base_21|) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 |v_ULTIMATE.start_main_~#t1157~0.offset_16|) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1157~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1157~0.base_21|) |v_ULTIMATE.start_main_~#t1157~0.offset_16| 0)) |v_#memory_int_27|) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~#t1157~0.offset=|v_ULTIMATE.start_main_~#t1157~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_~#t1157~0.base=|v_ULTIMATE.start_main_~#t1157~0.base_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ULTIMATE.start_main_~#t1158~0.base=|v_ULTIMATE.start_main_~#t1158~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ULTIMATE.start_main_~#t1159~0.base=|v_ULTIMATE.start_main_~#t1159~0.base_21|, ULTIMATE.start_main_~#t1160~0.offset=|v_ULTIMATE.start_main_~#t1160~0.offset_16|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ULTIMATE.start_main_~#t1160~0.base=|v_ULTIMATE.start_main_~#t1160~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1159~0.offset=|v_ULTIMATE.start_main_~#t1159~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ULTIMATE.start_main_~#t1158~0.offset=|v_ULTIMATE.start_main_~#t1158~0.offset_16|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1157~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1157~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1158~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1159~0.base, ULTIMATE.start_main_~#t1160~0.offset, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1160~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1159~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_~#t1158~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:35:29,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1158~0.base_12| 0)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1158~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1158~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1158~0.base_12| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1158~0.base_12| 1)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1158~0.base_12|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1158~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1158~0.base_12|) |v_ULTIMATE.start_main_~#t1158~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1158~0.base=|v_ULTIMATE.start_main_~#t1158~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1158~0.offset=|v_ULTIMATE.start_main_~#t1158~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1158~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1158~0.offset] because there is no mapped edge [2019-12-27 02:35:29,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1159~0.offset_8|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1159~0.base_8|) (not (= 0 |v_ULTIMATE.start_main_~#t1159~0.base_8|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1159~0.base_8| 4)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1159~0.base_8|)) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1159~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1159~0.base_8|) |v_ULTIMATE.start_main_~#t1159~0.offset_8| 2))) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1159~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1159~0.base=|v_ULTIMATE.start_main_~#t1159~0.base_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1159~0.offset=|v_ULTIMATE.start_main_~#t1159~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1159~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1159~0.offset] because there is no mapped edge [2019-12-27 02:35:29,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t1160~0.offset_10| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1160~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1160~0.base_12|) |v_ULTIMATE.start_main_~#t1160~0.offset_10| 3)) |v_#memory_int_23|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1160~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1160~0.base_12|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1160~0.base_12| 4)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1160~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t1160~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1160~0.base=|v_ULTIMATE.start_main_~#t1160~0.base_12|, ULTIMATE.start_main_~#t1160~0.offset=|v_ULTIMATE.start_main_~#t1160~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1160~0.base, ULTIMATE.start_main_~#t1160~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 02:35:29,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~z$r_buff1_thd4~0_Out123378738 ~z$r_buff0_thd4~0_In123378738) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In123378738 0)) (= ~z$r_buff1_thd3~0_Out123378738 ~z$r_buff0_thd3~0_In123378738) (= ~z$r_buff0_thd1~0_In123378738 ~z$r_buff1_thd1~0_Out123378738) (= ~z$r_buff1_thd2~0_Out123378738 ~z$r_buff0_thd2~0_In123378738) (= ~a~0_Out123378738 1) (= ~__unbuffered_p3_EBX~0_Out123378738 ~b~0_In123378738) (= 1 ~z$r_buff0_thd4~0_Out123378738) (= ~z$r_buff1_thd0~0_Out123378738 ~z$r_buff0_thd0~0_In123378738) (= ~__unbuffered_p3_EAX~0_Out123378738 ~a~0_Out123378738)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In123378738, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In123378738, ~b~0=~b~0_In123378738, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In123378738, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In123378738, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In123378738, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In123378738} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In123378738, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out123378738, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out123378738, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out123378738, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out123378738, ~a~0=~a~0_Out123378738, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In123378738, ~b~0=~b~0_In123378738, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out123378738, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out123378738, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out123378738, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out123378738, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In123378738, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In123378738, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In123378738} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 02:35:29,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:35:29,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:35:29,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1821760627 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1821760627 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1821760627| ~z$w_buff0_used~0_In1821760627)) (and (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1821760627| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1821760627, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1821760627} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1821760627, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1821760627, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1821760627|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 02:35:29,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-539155894 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-539155894 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-539155894 |P2Thread1of1ForFork2_#t~ite3_Out-539155894|)) (and (not .cse0) (= ~z$w_buff1~0_In-539155894 |P2Thread1of1ForFork2_#t~ite3_Out-539155894|) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-539155894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-539155894, ~z$w_buff1~0=~z$w_buff1~0_In-539155894, ~z~0=~z~0_In-539155894} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-539155894|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-539155894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-539155894, ~z$w_buff1~0=~z$w_buff1~0_In-539155894, ~z~0=~z~0_In-539155894} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:35:29,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 02:35:29,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-231952731 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-231952731 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-231952731|)) (and (= ~z$w_buff0_used~0_In-231952731 |P2Thread1of1ForFork2_#t~ite5_Out-231952731|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-231952731, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-231952731} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-231952731|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-231952731, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-231952731} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:35:29,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1557939963 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1557939963 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1557939963 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1557939963 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1557939963|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite6_Out-1557939963| ~z$w_buff1_used~0_In-1557939963) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1557939963, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1557939963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1557939963, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1557939963} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1557939963|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1557939963, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1557939963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1557939963, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1557939963} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:35:29,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In297160254 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In297160254 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out297160254|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In297160254 |P2Thread1of1ForFork2_#t~ite7_Out297160254|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In297160254, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In297160254} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In297160254, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In297160254, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out297160254|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:35:29,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1265526289 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1265526289 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1265526289 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1265526289 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In1265526289 |P2Thread1of1ForFork2_#t~ite8_Out1265526289|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out1265526289|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1265526289, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1265526289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1265526289, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1265526289} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1265526289, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1265526289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1265526289, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1265526289, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1265526289|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:35:29,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:35:29,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1704941179 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1704941179 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1704941179 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1704941179 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1704941179|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1704941179 |P3Thread1of1ForFork3_#t~ite12_Out1704941179|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1704941179, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1704941179, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1704941179, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704941179} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1704941179, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1704941179, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1704941179, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704941179, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1704941179|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 02:35:29,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In870498519 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In870498519 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out870498519 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out870498519 ~z$r_buff0_thd4~0_In870498519) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In870498519, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In870498519} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In870498519, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out870498519, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out870498519|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 02:35:29,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1485719584 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1485719584 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1485719584 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1485719584 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out1485719584| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1485719584| ~z$r_buff1_thd4~0_In1485719584)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1485719584, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485719584, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1485719584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1485719584} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1485719584, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485719584, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1485719584|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1485719584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1485719584} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 02:35:29,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 02:35:29,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:35:29,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1971437337 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1971437337 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite20_Out1971437337| |ULTIMATE.start_main_#t~ite19_Out1971437337|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1971437337 |ULTIMATE.start_main_#t~ite19_Out1971437337|) .cse2) (and (or .cse0 .cse1) (= ~z~0_In1971437337 |ULTIMATE.start_main_#t~ite19_Out1971437337|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1971437337, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1971437337, ~z$w_buff1~0=~z$w_buff1~0_In1971437337, ~z~0=~z~0_In1971437337} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1971437337|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1971437337, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1971437337, ~z$w_buff1~0=~z$w_buff1~0_In1971437337, ~z~0=~z~0_In1971437337, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1971437337|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:35:29,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1113382617 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1113382617 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1113382617| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1113382617| ~z$w_buff0_used~0_In-1113382617) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1113382617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113382617} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1113382617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113382617, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1113382617|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:35:29,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1987412925 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1987412925 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1987412925 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1987412925 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1987412925| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1987412925 |ULTIMATE.start_main_#t~ite22_Out-1987412925|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1987412925, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1987412925, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1987412925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1987412925} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1987412925, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1987412925, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1987412925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1987412925, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1987412925|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:35:29,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In904106825 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In904106825 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out904106825|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite23_Out904106825| ~z$r_buff0_thd0~0_In904106825)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In904106825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In904106825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In904106825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In904106825, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out904106825|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 02:35:29,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2001430487 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2001430487 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-2001430487 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-2001430487 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-2001430487 |ULTIMATE.start_main_#t~ite24_Out-2001430487|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out-2001430487| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2001430487, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2001430487, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2001430487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2001430487} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2001430487, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2001430487, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2001430487, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2001430487|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2001430487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 02:35:29,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In339406189 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In339406189 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In339406189 256)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In339406189 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In339406189 256) 0)))) (= ~z$w_buff0_used~0_In339406189 |ULTIMATE.start_main_#t~ite36_Out339406189|) (= |ULTIMATE.start_main_#t~ite37_Out339406189| |ULTIMATE.start_main_#t~ite36_Out339406189|)) (and (= ~z$w_buff0_used~0_In339406189 |ULTIMATE.start_main_#t~ite37_Out339406189|) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_In339406189| |ULTIMATE.start_main_#t~ite36_Out339406189|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In339406189, ~z$w_buff0_used~0=~z$w_buff0_used~0_In339406189, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In339406189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In339406189, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In339406189|, ~weak$$choice2~0=~weak$$choice2~0_In339406189} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In339406189, ~z$w_buff0_used~0=~z$w_buff0_used~0_In339406189, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In339406189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In339406189, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out339406189|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out339406189|, ~weak$$choice2~0=~weak$$choice2~0_In339406189} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:35:29,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1874744519 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1874744519 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1874744519 256)) (and (= (mod ~z$r_buff1_thd0~0_In1874744519 256) 0) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In1874744519 256)) .cse0))) .cse1 (= ~z$w_buff1_used~0_In1874744519 |ULTIMATE.start_main_#t~ite39_Out1874744519|) (= |ULTIMATE.start_main_#t~ite40_Out1874744519| |ULTIMATE.start_main_#t~ite39_Out1874744519|)) (and (= |ULTIMATE.start_main_#t~ite39_In1874744519| |ULTIMATE.start_main_#t~ite39_Out1874744519|) (= ~z$w_buff1_used~0_In1874744519 |ULTIMATE.start_main_#t~ite40_Out1874744519|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1874744519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1874744519, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1874744519|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1874744519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874744519, ~weak$$choice2~0=~weak$$choice2~0_In1874744519} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1874744519, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1874744519|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1874744519|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1874744519, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1874744519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874744519, ~weak$$choice2~0=~weak$$choice2~0_In1874744519} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:35:29,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:35:29,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:35:29,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:35:30,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:35:30 BasicIcfg [2019-12-27 02:35:30,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:35:30,012 INFO L168 Benchmark]: Toolchain (without parser) took 90623.56 ms. Allocated memory was 138.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 02:35:30,013 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 02:35:30,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 921.08 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 154.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:35:30,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.62 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:35:30,015 INFO L168 Benchmark]: Boogie Preprocessor took 46.35 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:35:30,015 INFO L168 Benchmark]: RCFGBuilder took 872.48 ms. Allocated memory is still 202.4 MB. Free memory was 149.0 MB in the beginning and 100.0 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:35:30,016 INFO L168 Benchmark]: TraceAbstraction took 88698.55 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 99.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 02:35:30,019 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.45 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 921.08 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 154.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.62 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.35 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.48 ms. Allocated memory is still 202.4 MB. Free memory was 149.0 MB in the beginning and 100.0 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88698.55 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 99.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1157, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1158, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1159, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1160, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.4s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3025 SDtfs, 4009 SDslu, 8529 SDs, 0 SdLazy, 3259 SolverSat, 283 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 26 SyntacticMatches, 16 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109298occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 204965 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 821 NumberOfCodeBlocks, 821 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 130186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...