/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/mix032_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:10:48,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:10:48,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:10:48,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:10:48,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:10:48,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:10:48,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:10:48,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:10:48,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:10:48,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:10:48,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:10:48,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:10:48,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:10:48,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:10:48,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:10:48,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:10:48,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:10:48,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:10:48,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:10:48,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:10:48,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:10:48,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:10:48,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:10:48,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:10:48,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:10:48,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:10:48,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:10:48,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:10:48,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:10:48,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:10:48,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:10:48,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:10:48,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:10:48,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:10:48,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:10:48,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:10:48,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:10:48,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:10:48,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:10:48,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:10:48,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:10:48,087 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-18 17:10:48,101 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:10:48,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:10:48,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:10:48,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:10:48,103 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:10:48,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:10:48,103 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:10:48,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:10:48,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:10:48,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:10:48,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:10:48,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:10:48,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:10:48,104 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:10:48,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:10:48,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:10:48,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:10:48,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:10:48,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:10:48,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:10:48,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:10:48,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:10:48,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:10:48,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:10:48,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:10:48,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:10:48,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:10:48,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:10:48,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:10:48,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:10:48,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:10:48,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:10:48,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:10:48,391 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:10:48,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-18 17:10:48,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f7137d5/b1366cfc253148f58d79d3a4abe16be1/FLAG6ea6de7e9 [2019-12-18 17:10:48,924 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:10:48,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-18 17:10:48,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f7137d5/b1366cfc253148f58d79d3a4abe16be1/FLAG6ea6de7e9 [2019-12-18 17:10:49,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f7137d5/b1366cfc253148f58d79d3a4abe16be1 [2019-12-18 17:10:49,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:10:49,285 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:10:49,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:10:49,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:10:49,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:10:49,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:10:49" (1/1) ... [2019-12-18 17:10:49,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ef50cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:49, skipping insertion in model container [2019-12-18 17:10:49,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:10:49" (1/1) ... [2019-12-18 17:10:49,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:10:49,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:10:49,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:10:49,887 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:10:49,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:10:50,052 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:10:50,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50 WrapperNode [2019-12-18 17:10:50,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:10:50,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:10:50,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:10:50,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:10:50,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (1/1) ... [2019-12-18 17:10:50,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (1/1) ... [2019-12-18 17:10:50,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:10:50,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:10:50,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:10:50,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:10:50,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (1/1) ... [2019-12-18 17:10:50,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (1/1) ... [2019-12-18 17:10:50,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (1/1) ... [2019-12-18 17:10:50,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (1/1) ... [2019-12-18 17:10:50,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (1/1) ... [2019-12-18 17:10:50,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (1/1) ... [2019-12-18 17:10:50,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (1/1) ... [2019-12-18 17:10:50,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:10:50,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:10:50,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:10:50,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:10:50,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (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-18 17:10:50,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:10:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:10:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:10:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:10:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:10:50,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:10:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:10:50,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:10:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:10:50,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:10:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:10:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:10:50,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:10:50,262 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:10:51,220 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:10:51,221 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:10:51,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:10:51 BoogieIcfgContainer [2019-12-18 17:10:51,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:10:51,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:10:51,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:10:51,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:10:51,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:10:49" (1/3) ... [2019-12-18 17:10:51,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15081aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:10:51, skipping insertion in model container [2019-12-18 17:10:51,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:50" (2/3) ... [2019-12-18 17:10:51,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15081aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:10:51, skipping insertion in model container [2019-12-18 17:10:51,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:10:51" (3/3) ... [2019-12-18 17:10:51,231 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.oepc.i [2019-12-18 17:10:51,240 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:10:51,240 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:10:51,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:10:51,249 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:10:51,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,291 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,292 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,292 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,293 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,293 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,301 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,302 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,327 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,327 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,359 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,361 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:51,392 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:10:51,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:10:51,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:10:51,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:10:51,413 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:10:51,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:10:51,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:10:51,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:10:51,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:10:51,431 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-18 17:10:51,433 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 17:10:51,525 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 17:10:51,525 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:10:51,549 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:10:51,591 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 17:10:51,646 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 17:10:51,646 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:10:51,664 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:10:51,706 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 17:10:51,707 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:10:56,206 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-18 17:10:56,993 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 17:10:57,142 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 17:10:57,176 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-18 17:10:57,177 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 17:10:57,181 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-18 17:11:20,515 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-18 17:11:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-18 17:11:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:11:20,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:11:20,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:11:20,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:11:20,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:11:20,530 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-18 17:11:20,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:11:20,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313977197] [2019-12-18 17:11:20,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:11:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:11:20,829 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-18 17:11:20,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313977197] [2019-12-18 17:11:20,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:11:20,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:11:20,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517700205] [2019-12-18 17:11:20,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:11:20,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:11:20,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:11:20,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:11:20,850 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-18 17:11:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:11:24,886 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-18 17:11:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:11:24,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:11:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:11:25,638 INFO L225 Difference]: With dead ends: 128376 [2019-12-18 17:11:25,638 INFO L226 Difference]: Without dead ends: 120914 [2019-12-18 17:11:25,639 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-18 17:11:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-18 17:11:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-18 17:11:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-18 17:11:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-18 17:11:36,785 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-18 17:11:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:11:36,786 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-18 17:11:36,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:11:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-18 17:11:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:11:36,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:11:36,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:11:36,791 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:11:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:11:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-18 17:11:36,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:11:36,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562977445] [2019-12-18 17:11:36,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:11:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:11:36,911 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-18 17:11:36,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562977445] [2019-12-18 17:11:36,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:11:36,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:11:36,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824608120] [2019-12-18 17:11:36,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:11:36,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:11:36,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:11:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:11:36,914 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-18 17:11:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:11:42,580 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-18 17:11:42,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:11:42,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:11:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:11:43,436 INFO L225 Difference]: With dead ends: 187704 [2019-12-18 17:11:43,436 INFO L226 Difference]: Without dead ends: 187655 [2019-12-18 17:11:43,437 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-18 17:11:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-18 17:11:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-18 17:11:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-18 17:11:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-18 17:11:55,320 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-18 17:11:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:11:55,320 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-18 17:11:55,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:11:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-18 17:11:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:11:55,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:11:55,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:11:55,328 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:11:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:11:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-18 17:11:55,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:11:55,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969960645] [2019-12-18 17:11:55,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:11:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:11:55,414 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-18 17:11:55,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969960645] [2019-12-18 17:11:55,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:11:55,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:11:55,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466769479] [2019-12-18 17:11:55,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:11:55,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:11:55,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:11:55,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:11:55,418 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-18 17:11:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:11:55,555 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-18 17:11:55,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:11:55,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:11:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:11:55,670 INFO L225 Difference]: With dead ends: 36261 [2019-12-18 17:11:55,670 INFO L226 Difference]: Without dead ends: 36261 [2019-12-18 17:11:55,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:11:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-18 17:12:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-18 17:12:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-18 17:12:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-18 17:12:02,009 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-18 17:12:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:02,009 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-18 17:12:02,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:12:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-18 17:12:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:12:02,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:02,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:12:02,013 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:02,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-18 17:12:02,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:02,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760575659] [2019-12-18 17:12:02,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:02,106 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-18 17:12:02,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760575659] [2019-12-18 17:12:02,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:02,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:12:02,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143572795] [2019-12-18 17:12:02,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:12:02,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:12:02,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:12:02,109 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-18 17:12:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:02,799 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-18 17:12:02,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:12:02,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 17:12:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:02,910 INFO L225 Difference]: With dead ends: 50300 [2019-12-18 17:12:02,911 INFO L226 Difference]: Without dead ends: 50300 [2019-12-18 17:12:02,911 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-18 17:12:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-18 17:12:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-18 17:12:03,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-18 17:12:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-18 17:12:03,704 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-18 17:12:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:03,705 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-18 17:12:03,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:12:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-18 17:12:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:12:03,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:03,715 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] [2019-12-18 17:12:03,715 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-18 17:12:03,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:03,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284896702] [2019-12-18 17:12:03,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:12:03,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284896702] [2019-12-18 17:12:03,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:03,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:12:03,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107299626] [2019-12-18 17:12:03,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:12:03,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:03,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:12:03,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:12:03,830 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-18 17:12:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:05,093 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-18 17:12:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:12:05,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 17:12:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:05,224 INFO L225 Difference]: With dead ends: 64122 [2019-12-18 17:12:05,224 INFO L226 Difference]: Without dead ends: 64115 [2019-12-18 17:12:05,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:12:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-18 17:12:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-18 17:12:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 17:12:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-18 17:12:06,151 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-18 17:12:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:06,152 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-18 17:12:06,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:12:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-18 17:12:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:12:06,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:06,167 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] [2019-12-18 17:12:06,167 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-18 17:12:06,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:06,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323037430] [2019-12-18 17:12:06,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:06,229 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-18 17:12:06,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323037430] [2019-12-18 17:12:06,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:06,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:12:06,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347442534] [2019-12-18 17:12:06,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:12:06,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:12:06,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:12:06,231 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-18 17:12:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:06,296 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-18 17:12:06,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:12:06,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:12:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:06,320 INFO L225 Difference]: With dead ends: 17024 [2019-12-18 17:12:06,321 INFO L226 Difference]: Without dead ends: 17024 [2019-12-18 17:12:06,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:12:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-18 17:12:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-18 17:12:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-18 17:12:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-18 17:12:06,869 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-18 17:12:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:06,869 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-18 17:12:06,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:12:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-18 17:12:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:12:06,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:06,881 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] [2019-12-18 17:12:06,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:06,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:06,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-18 17:12:06,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:06,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497418248] [2019-12-18 17:12:06,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:06,944 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-18 17:12:06,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497418248] [2019-12-18 17:12:06,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:06,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:12:06,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250729483] [2019-12-18 17:12:06,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:12:06,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:12:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:12:06,946 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-18 17:12:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:07,053 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-18 17:12:07,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:12:07,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 17:12:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:07,086 INFO L225 Difference]: With dead ends: 24375 [2019-12-18 17:12:07,086 INFO L226 Difference]: Without dead ends: 24375 [2019-12-18 17:12:07,087 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-18 17:12:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-18 17:12:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-18 17:12:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-18 17:12:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-18 17:12:07,413 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-18 17:12:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:07,414 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-18 17:12:07,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:12:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-18 17:12:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:12:07,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:07,427 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] [2019-12-18 17:12:07,427 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-18 17:12:07,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:07,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834793350] [2019-12-18 17:12:07,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:07,509 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-18 17:12:07,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834793350] [2019-12-18 17:12:07,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:07,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:12:07,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335957614] [2019-12-18 17:12:07,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:12:07,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:07,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:12:07,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:12:07,511 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-18 17:12:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:08,120 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-18 17:12:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:12:08,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 17:12:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:08,156 INFO L225 Difference]: With dead ends: 26038 [2019-12-18 17:12:08,156 INFO L226 Difference]: Without dead ends: 26038 [2019-12-18 17:12:08,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:12:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-18 17:12:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-18 17:12:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-18 17:12:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-18 17:12:08,481 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-18 17:12:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:08,482 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-18 17:12:08,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:12:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-18 17:12:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:12:08,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:08,503 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] [2019-12-18 17:12:08,504 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:08,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:08,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-18 17:12:08,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:08,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855256614] [2019-12-18 17:12:08,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:12:08,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855256614] [2019-12-18 17:12:08,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:08,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:12:08,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911432312] [2019-12-18 17:12:08,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:12:08,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:12:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:12:08,617 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-18 17:12:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:10,020 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-18 17:12:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:12:10,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:12:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:10,061 INFO L225 Difference]: With dead ends: 28794 [2019-12-18 17:12:10,061 INFO L226 Difference]: Without dead ends: 28794 [2019-12-18 17:12:10,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:12:10,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-18 17:12:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-18 17:12:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-18 17:12:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-18 17:12:10,410 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-18 17:12:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:10,410 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-18 17:12:10,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:12:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-18 17:12:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:12:10,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:10,436 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-18 17:12:10,436 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:10,437 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-18 17:12:10,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:10,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086171937] [2019-12-18 17:12:10,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:10,500 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-18 17:12:10,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086171937] [2019-12-18 17:12:10,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:10,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:12:10,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933903189] [2019-12-18 17:12:10,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:12:10,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:10,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:12:10,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:12:10,503 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 4 states. [2019-12-18 17:12:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:10,630 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-18 17:12:10,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:12:10,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 17:12:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:10,655 INFO L225 Difference]: With dead ends: 33180 [2019-12-18 17:12:10,656 INFO L226 Difference]: Without dead ends: 16657 [2019-12-18 17:12:10,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-18 17:12:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-18 17:12:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-18 17:12:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-18 17:12:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-18 17:12:10,901 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-18 17:12:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:10,901 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-18 17:12:10,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:12:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-18 17:12:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:12:10,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:10,920 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-18 17:12:10,920 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-18 17:12:10,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:10,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081648127] [2019-12-18 17:12:10,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:10,985 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-18 17:12:10,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081648127] [2019-12-18 17:12:10,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:10,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:12:10,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115448955] [2019-12-18 17:12:10,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:12:10,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:12:10,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:12:10,987 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-18 17:12:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:11,063 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-18 17:12:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:12:11,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 17:12:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:11,101 INFO L225 Difference]: With dead ends: 16582 [2019-12-18 17:12:11,101 INFO L226 Difference]: Without dead ends: 16582 [2019-12-18 17:12:11,102 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-18 17:12:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-18 17:12:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-18 17:12:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-18 17:12:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-18 17:12:11,636 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-18 17:12:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:11,637 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-18 17:12:11,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:12:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-18 17:12:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:12:11,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:11,658 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-18 17:12:11,658 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:11,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:11,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-18 17:12:11,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:11,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849027851] [2019-12-18 17:12:11,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:11,744 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-18 17:12:11,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849027851] [2019-12-18 17:12:11,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:11,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:12:11,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224838102] [2019-12-18 17:12:11,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:12:11,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:11,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:12:11,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:12:11,747 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 4 states. [2019-12-18 17:12:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:11,856 INFO L93 Difference]: Finished difference Result 26060 states and 77460 transitions. [2019-12-18 17:12:11,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:12:11,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 17:12:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:11,880 INFO L225 Difference]: With dead ends: 26060 [2019-12-18 17:12:11,880 INFO L226 Difference]: Without dead ends: 11670 [2019-12-18 17:12:11,881 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-18 17:12:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-18 17:12:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 11605. [2019-12-18 17:12:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-18 17:12:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-18 17:12:12,220 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-18 17:12:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:12,221 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-18 17:12:12,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:12:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-18 17:12:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:12:12,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:12,242 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-18 17:12:12,243 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-18 17:12:12,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:12,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152259920] [2019-12-18 17:12:12,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:12,319 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-18 17:12:12,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152259920] [2019-12-18 17:12:12,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:12,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:12:12,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877898069] [2019-12-18 17:12:12,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:12:12,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:12:12,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:12:12,324 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 5 states. [2019-12-18 17:12:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:12,390 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-18 17:12:12,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:12:12,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:12:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:12,405 INFO L225 Difference]: With dead ends: 10656 [2019-12-18 17:12:12,405 INFO L226 Difference]: Without dead ends: 7573 [2019-12-18 17:12:12,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:12:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-18 17:12:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-18 17:12:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-18 17:12:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-18 17:12:12,603 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-18 17:12:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:12,603 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-18 17:12:12,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:12:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-18 17:12:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:12:12,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:12,616 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, 1, 1, 1, 1] [2019-12-18 17:12:12,617 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-18 17:12:12,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:12,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799639217] [2019-12-18 17:12:12,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:12,689 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-18 17:12:12,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799639217] [2019-12-18 17:12:12,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:12,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:12:12,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148299867] [2019-12-18 17:12:12,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:12:12,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:12,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:12:12,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:12:12,691 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-18 17:12:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:12,773 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-18 17:12:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:12:12,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:12:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:12,791 INFO L225 Difference]: With dead ends: 10082 [2019-12-18 17:12:12,792 INFO L226 Difference]: Without dead ends: 10082 [2019-12-18 17:12:12,793 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-18 17:12:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-18 17:12:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-18 17:12:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-18 17:12:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-18 17:12:12,981 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-18 17:12:12,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:12,981 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-18 17:12:12,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:12:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-18 17:12:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:12:12,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:12,991 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, 1, 1, 1, 1] [2019-12-18 17:12:12,991 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:12,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:12,991 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-18 17:12:12,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:12,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433803459] [2019-12-18 17:12:12,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:13,079 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-18 17:12:13,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433803459] [2019-12-18 17:12:13,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:13,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:12:13,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085459536] [2019-12-18 17:12:13,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:12:13,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:13,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:12:13,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:12:13,081 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 7 states. [2019-12-18 17:12:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:13,413 INFO L93 Difference]: Finished difference Result 15437 states and 48014 transitions. [2019-12-18 17:12:13,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:12:13,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:12:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:13,434 INFO L225 Difference]: With dead ends: 15437 [2019-12-18 17:12:13,434 INFO L226 Difference]: Without dead ends: 11573 [2019-12-18 17:12:13,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:12:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-18 17:12:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9445. [2019-12-18 17:12:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-18 17:12:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-18 17:12:13,625 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-18 17:12:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:13,626 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-18 17:12:13,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:12:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-18 17:12:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:12:13,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:13,638 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, 1, 1, 1, 1] [2019-12-18 17:12:13,638 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-18 17:12:13,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:13,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943288344] [2019-12-18 17:12:13,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:13,722 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-18 17:12:13,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943288344] [2019-12-18 17:12:13,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:13,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:12:13,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889566077] [2019-12-18 17:12:13,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:12:13,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:12:13,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:12:13,726 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 7 states. [2019-12-18 17:12:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:14,028 INFO L93 Difference]: Finished difference Result 17385 states and 53705 transitions. [2019-12-18 17:12:14,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:12:14,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:12:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:14,047 INFO L225 Difference]: With dead ends: 17385 [2019-12-18 17:12:14,047 INFO L226 Difference]: Without dead ends: 13105 [2019-12-18 17:12:14,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:12:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-12-18 17:12:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10746. [2019-12-18 17:12:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-18 17:12:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 33681 transitions. [2019-12-18 17:12:14,348 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 33681 transitions. Word has length 64 [2019-12-18 17:12:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:14,348 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 33681 transitions. [2019-12-18 17:12:14,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:12:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 33681 transitions. [2019-12-18 17:12:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:12:14,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:14,362 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, 1, 1, 1, 1] [2019-12-18 17:12:14,362 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:14,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:14,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-18 17:12:14,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:14,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869704918] [2019-12-18 17:12:14,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:14,467 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-18 17:12:14,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869704918] [2019-12-18 17:12:14,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:14,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:12:14,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218514703] [2019-12-18 17:12:14,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:12:14,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:14,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:12:14,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:12:14,469 INFO L87 Difference]: Start difference. First operand 10746 states and 33681 transitions. Second operand 9 states. [2019-12-18 17:12:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:15,519 INFO L93 Difference]: Finished difference Result 24832 states and 76056 transitions. [2019-12-18 17:12:15,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:12:15,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 17:12:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:15,549 INFO L225 Difference]: With dead ends: 24832 [2019-12-18 17:12:15,549 INFO L226 Difference]: Without dead ends: 22344 [2019-12-18 17:12:15,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:12:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22344 states. [2019-12-18 17:12:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22344 to 10578. [2019-12-18 17:12:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-18 17:12:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 33121 transitions. [2019-12-18 17:12:15,801 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 33121 transitions. Word has length 64 [2019-12-18 17:12:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:15,801 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 33121 transitions. [2019-12-18 17:12:15,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:12:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 33121 transitions. [2019-12-18 17:12:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:12:15,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:15,813 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, 1, 1, 1, 1] [2019-12-18 17:12:15,813 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1527941036, now seen corresponding path program 4 times [2019-12-18 17:12:15,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:15,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947475426] [2019-12-18 17:12:15,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:15,931 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-18 17:12:15,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947475426] [2019-12-18 17:12:15,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:15,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:12:15,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220675332] [2019-12-18 17:12:15,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:12:15,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:12:15,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:12:15,937 INFO L87 Difference]: Start difference. First operand 10578 states and 33121 transitions. Second operand 9 states. [2019-12-18 17:12:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:17,120 INFO L93 Difference]: Finished difference Result 28772 states and 88210 transitions. [2019-12-18 17:12:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:12:17,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 17:12:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:17,157 INFO L225 Difference]: With dead ends: 28772 [2019-12-18 17:12:17,157 INFO L226 Difference]: Without dead ends: 26348 [2019-12-18 17:12:17,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:12:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26348 states. [2019-12-18 17:12:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26348 to 10606. [2019-12-18 17:12:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10606 states. [2019-12-18 17:12:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 33275 transitions. [2019-12-18 17:12:17,445 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 33275 transitions. Word has length 64 [2019-12-18 17:12:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:17,446 INFO L462 AbstractCegarLoop]: Abstraction has 10606 states and 33275 transitions. [2019-12-18 17:12:17,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:12:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 33275 transitions. [2019-12-18 17:12:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:12:17,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:17,463 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, 1, 1, 1, 1] [2019-12-18 17:12:17,463 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 5 times [2019-12-18 17:12:17,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:17,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474150967] [2019-12-18 17:12:17,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:17,537 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-18 17:12:17,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474150967] [2019-12-18 17:12:17,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:17,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:12:17,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082629212] [2019-12-18 17:12:17,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:12:17,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:17,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:12:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:12:17,539 INFO L87 Difference]: Start difference. First operand 10606 states and 33275 transitions. Second operand 3 states. [2019-12-18 17:12:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:17,641 INFO L93 Difference]: Finished difference Result 12322 states and 38579 transitions. [2019-12-18 17:12:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:12:17,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:12:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:17,664 INFO L225 Difference]: With dead ends: 12322 [2019-12-18 17:12:17,664 INFO L226 Difference]: Without dead ends: 12322 [2019-12-18 17:12:17,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:12:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-12-18 17:12:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11074. [2019-12-18 17:12:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-18 17:12:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 34835 transitions. [2019-12-18 17:12:17,859 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 34835 transitions. Word has length 64 [2019-12-18 17:12:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:17,859 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 34835 transitions. [2019-12-18 17:12:17,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:12:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 34835 transitions. [2019-12-18 17:12:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:12:17,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:17,872 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, 1, 1, 1, 1, 1] [2019-12-18 17:12:17,872 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-18 17:12:17,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:17,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442952421] [2019-12-18 17:12:17,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:18,087 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-18 17:12:18,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442952421] [2019-12-18 17:12:18,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:18,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:12:18,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217394661] [2019-12-18 17:12:18,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:12:18,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:12:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:12:18,090 INFO L87 Difference]: Start difference. First operand 11074 states and 34835 transitions. Second operand 8 states. [2019-12-18 17:12:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:18,868 INFO L93 Difference]: Finished difference Result 29477 states and 90578 transitions. [2019-12-18 17:12:18,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:12:18,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 17:12:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:18,905 INFO L225 Difference]: With dead ends: 29477 [2019-12-18 17:12:18,905 INFO L226 Difference]: Without dead ends: 26544 [2019-12-18 17:12:18,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:12:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2019-12-18 17:12:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 11347. [2019-12-18 17:12:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-18 17:12:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 35865 transitions. [2019-12-18 17:12:19,193 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 35865 transitions. Word has length 65 [2019-12-18 17:12:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:19,193 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 35865 transitions. [2019-12-18 17:12:19,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:12:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 35865 transitions. [2019-12-18 17:12:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:12:19,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:19,206 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, 1, 1, 1, 1, 1] [2019-12-18 17:12:19,206 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-18 17:12:19,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:19,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845797565] [2019-12-18 17:12:19,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:19,326 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-18 17:12:19,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845797565] [2019-12-18 17:12:19,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:19,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:12:19,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18087313] [2019-12-18 17:12:19,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:12:19,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:19,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:12:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:12:19,328 INFO L87 Difference]: Start difference. First operand 11347 states and 35865 transitions. Second operand 9 states. [2019-12-18 17:12:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:20,312 INFO L93 Difference]: Finished difference Result 32061 states and 97811 transitions. [2019-12-18 17:12:20,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:12:20,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 17:12:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:20,352 INFO L225 Difference]: With dead ends: 32061 [2019-12-18 17:12:20,352 INFO L226 Difference]: Without dead ends: 29128 [2019-12-18 17:12:20,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 17:12:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-18 17:12:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 11355. [2019-12-18 17:12:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11355 states. [2019-12-18 17:12:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 35880 transitions. [2019-12-18 17:12:20,653 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 35880 transitions. Word has length 65 [2019-12-18 17:12:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:20,653 INFO L462 AbstractCegarLoop]: Abstraction has 11355 states and 35880 transitions. [2019-12-18 17:12:20,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:12:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 35880 transitions. [2019-12-18 17:12:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:12:20,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:20,671 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, 1, 1, 1, 1, 1] [2019-12-18 17:12:20,671 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:20,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:20,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1813356122, now seen corresponding path program 3 times [2019-12-18 17:12:20,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:20,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008593497] [2019-12-18 17:12:20,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:20,792 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-18 17:12:20,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008593497] [2019-12-18 17:12:20,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:20,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:12:20,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170993295] [2019-12-18 17:12:20,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:12:20,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:20,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:12:20,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:12:20,794 INFO L87 Difference]: Start difference. First operand 11355 states and 35880 transitions. Second operand 9 states. [2019-12-18 17:12:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:22,046 INFO L93 Difference]: Finished difference Result 33909 states and 103392 transitions. [2019-12-18 17:12:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:12:22,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 17:12:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:22,102 INFO L225 Difference]: With dead ends: 33909 [2019-12-18 17:12:22,102 INFO L226 Difference]: Without dead ends: 30991 [2019-12-18 17:12:22,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:12:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30991 states. [2019-12-18 17:12:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30991 to 11298. [2019-12-18 17:12:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-12-18 17:12:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 35607 transitions. [2019-12-18 17:12:22,533 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 35607 transitions. Word has length 65 [2019-12-18 17:12:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:22,533 INFO L462 AbstractCegarLoop]: Abstraction has 11298 states and 35607 transitions. [2019-12-18 17:12:22,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:12:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 35607 transitions. [2019-12-18 17:12:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:12:22,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:22,547 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, 1, 1, 1, 1, 1] [2019-12-18 17:12:22,547 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1724524394, now seen corresponding path program 4 times [2019-12-18 17:12:22,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:22,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285355708] [2019-12-18 17:12:22,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:22,638 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-18 17:12:22,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285355708] [2019-12-18 17:12:22,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:22,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:12:22,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585300655] [2019-12-18 17:12:22,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:12:22,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:12:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:12:22,641 INFO L87 Difference]: Start difference. First operand 11298 states and 35607 transitions. Second operand 4 states. [2019-12-18 17:12:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:22,782 INFO L93 Difference]: Finished difference Result 11142 states and 34983 transitions. [2019-12-18 17:12:22,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:12:22,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 17:12:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:22,809 INFO L225 Difference]: With dead ends: 11142 [2019-12-18 17:12:22,809 INFO L226 Difference]: Without dead ends: 11142 [2019-12-18 17:12:22,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:12:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-18 17:12:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10674. [2019-12-18 17:12:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2019-12-18 17:12:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 33423 transitions. [2019-12-18 17:12:23,131 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 33423 transitions. Word has length 65 [2019-12-18 17:12:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:23,131 INFO L462 AbstractCegarLoop]: Abstraction has 10674 states and 33423 transitions. [2019-12-18 17:12:23,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:12:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 33423 transitions. [2019-12-18 17:12:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:12:23,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:23,149 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, 1, 1, 1, 1, 1] [2019-12-18 17:12:23,149 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-18 17:12:23,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:23,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688245372] [2019-12-18 17:12:23,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:23,477 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-18 17:12:23,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688245372] [2019-12-18 17:12:23,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:23,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:12:23,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116361954] [2019-12-18 17:12:23,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 17:12:23,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 17:12:23,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:12:23,479 INFO L87 Difference]: Start difference. First operand 10674 states and 33423 transitions. Second operand 14 states. [2019-12-18 17:12:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:25,985 INFO L93 Difference]: Finished difference Result 23267 states and 69749 transitions. [2019-12-18 17:12:25,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 17:12:25,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-18 17:12:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:26,017 INFO L225 Difference]: With dead ends: 23267 [2019-12-18 17:12:26,017 INFO L226 Difference]: Without dead ends: 23015 [2019-12-18 17:12:26,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 17:12:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23015 states. [2019-12-18 17:12:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23015 to 16636. [2019-12-18 17:12:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16636 states. [2019-12-18 17:12:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16636 states to 16636 states and 50248 transitions. [2019-12-18 17:12:26,333 INFO L78 Accepts]: Start accepts. Automaton has 16636 states and 50248 transitions. Word has length 65 [2019-12-18 17:12:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:26,333 INFO L462 AbstractCegarLoop]: Abstraction has 16636 states and 50248 transitions. [2019-12-18 17:12:26,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 17:12:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 16636 states and 50248 transitions. [2019-12-18 17:12:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:12:26,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:26,351 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, 1, 1, 1, 1, 1] [2019-12-18 17:12:26,351 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash -130492415, now seen corresponding path program 2 times [2019-12-18 17:12:26,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:26,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64103036] [2019-12-18 17:12:26,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:26,682 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-18 17:12:26,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64103036] [2019-12-18 17:12:26,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:26,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:12:26,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777732683] [2019-12-18 17:12:26,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:12:26,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:26,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:12:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:12:26,684 INFO L87 Difference]: Start difference. First operand 16636 states and 50248 transitions. Second operand 13 states. [2019-12-18 17:12:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:29,253 INFO L93 Difference]: Finished difference Result 33016 states and 96812 transitions. [2019-12-18 17:12:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 17:12:29,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-18 17:12:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:29,298 INFO L225 Difference]: With dead ends: 33016 [2019-12-18 17:12:29,298 INFO L226 Difference]: Without dead ends: 32796 [2019-12-18 17:12:29,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 17:12:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32796 states. [2019-12-18 17:12:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32796 to 19112. [2019-12-18 17:12:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19112 states. [2019-12-18 17:12:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19112 states to 19112 states and 56816 transitions. [2019-12-18 17:12:29,703 INFO L78 Accepts]: Start accepts. Automaton has 19112 states and 56816 transitions. Word has length 65 [2019-12-18 17:12:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:29,703 INFO L462 AbstractCegarLoop]: Abstraction has 19112 states and 56816 transitions. [2019-12-18 17:12:29,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:12:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 19112 states and 56816 transitions. [2019-12-18 17:12:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:12:29,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:29,724 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, 1, 1, 1, 1, 1] [2019-12-18 17:12:29,724 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1979760167, now seen corresponding path program 3 times [2019-12-18 17:12:29,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:29,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770675961] [2019-12-18 17:12:29,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:29,791 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-18 17:12:29,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770675961] [2019-12-18 17:12:29,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:29,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:12:29,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38414420] [2019-12-18 17:12:29,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:12:29,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:29,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:12:29,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:12:29,793 INFO L87 Difference]: Start difference. First operand 19112 states and 56816 transitions. Second operand 3 states. [2019-12-18 17:12:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:29,870 INFO L93 Difference]: Finished difference Result 19111 states and 56814 transitions. [2019-12-18 17:12:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:12:29,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:12:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:29,898 INFO L225 Difference]: With dead ends: 19111 [2019-12-18 17:12:29,898 INFO L226 Difference]: Without dead ends: 19111 [2019-12-18 17:12:29,898 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-18 17:12:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19111 states. [2019-12-18 17:12:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19111 to 14862. [2019-12-18 17:12:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14862 states. [2019-12-18 17:12:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14862 states to 14862 states and 45021 transitions. [2019-12-18 17:12:30,166 INFO L78 Accepts]: Start accepts. Automaton has 14862 states and 45021 transitions. Word has length 65 [2019-12-18 17:12:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:30,166 INFO L462 AbstractCegarLoop]: Abstraction has 14862 states and 45021 transitions. [2019-12-18 17:12:30,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:12:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 14862 states and 45021 transitions. [2019-12-18 17:12:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:12:30,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:30,183 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, 1, 1, 1, 1, 1, 1] [2019-12-18 17:12:30,183 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:30,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:30,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1101261716, now seen corresponding path program 1 times [2019-12-18 17:12:30,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:30,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114767541] [2019-12-18 17:12:30,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:30,252 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-18 17:12:30,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114767541] [2019-12-18 17:12:30,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:30,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:12:30,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265487888] [2019-12-18 17:12:30,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:12:30,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:12:30,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:12:30,254 INFO L87 Difference]: Start difference. First operand 14862 states and 45021 transitions. Second operand 3 states. [2019-12-18 17:12:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:30,302 INFO L93 Difference]: Finished difference Result 10483 states and 31260 transitions. [2019-12-18 17:12:30,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:12:30,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 17:12:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:30,319 INFO L225 Difference]: With dead ends: 10483 [2019-12-18 17:12:30,319 INFO L226 Difference]: Without dead ends: 10483 [2019-12-18 17:12:30,319 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-18 17:12:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10483 states. [2019-12-18 17:12:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10483 to 9943. [2019-12-18 17:12:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9943 states. [2019-12-18 17:12:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9943 states to 9943 states and 29623 transitions. [2019-12-18 17:12:30,475 INFO L78 Accepts]: Start accepts. Automaton has 9943 states and 29623 transitions. Word has length 66 [2019-12-18 17:12:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:30,475 INFO L462 AbstractCegarLoop]: Abstraction has 9943 states and 29623 transitions. [2019-12-18 17:12:30,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:12:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9943 states and 29623 transitions. [2019-12-18 17:12:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:12:30,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:30,485 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:12:30,485 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:30,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:30,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 1 times [2019-12-18 17:12:30,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:30,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484385240] [2019-12-18 17:12:30,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:30,664 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-18 17:12:30,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484385240] [2019-12-18 17:12:30,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:30,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:12:30,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012105988] [2019-12-18 17:12:30,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:12:30,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:30,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:12:30,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:12:30,666 INFO L87 Difference]: Start difference. First operand 9943 states and 29623 transitions. Second operand 10 states. [2019-12-18 17:12:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:32,006 INFO L93 Difference]: Finished difference Result 17564 states and 51651 transitions. [2019-12-18 17:12:32,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:12:32,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 17:12:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:32,024 INFO L225 Difference]: With dead ends: 17564 [2019-12-18 17:12:32,024 INFO L226 Difference]: Without dead ends: 12892 [2019-12-18 17:12:32,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:12:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12892 states. [2019-12-18 17:12:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12892 to 10281. [2019-12-18 17:12:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10281 states. [2019-12-18 17:12:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10281 states to 10281 states and 30435 transitions. [2019-12-18 17:12:32,199 INFO L78 Accepts]: Start accepts. Automaton has 10281 states and 30435 transitions. Word has length 67 [2019-12-18 17:12:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:32,199 INFO L462 AbstractCegarLoop]: Abstraction has 10281 states and 30435 transitions. [2019-12-18 17:12:32,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:12:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 10281 states and 30435 transitions. [2019-12-18 17:12:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:12:32,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:32,210 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:12:32,210 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:32,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:32,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 2 times [2019-12-18 17:12:32,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:32,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403943057] [2019-12-18 17:12:32,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:12:32,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403943057] [2019-12-18 17:12:32,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:32,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:12:32,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679982513] [2019-12-18 17:12:32,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:12:32,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:32,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:12:32,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:12:32,391 INFO L87 Difference]: Start difference. First operand 10281 states and 30435 transitions. Second operand 10 states. [2019-12-18 17:12:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:33,762 INFO L93 Difference]: Finished difference Result 17204 states and 49957 transitions. [2019-12-18 17:12:33,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:12:33,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 17:12:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:33,782 INFO L225 Difference]: With dead ends: 17204 [2019-12-18 17:12:33,782 INFO L226 Difference]: Without dead ends: 13975 [2019-12-18 17:12:33,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:12:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13975 states. [2019-12-18 17:12:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13975 to 10630. [2019-12-18 17:12:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10630 states. [2019-12-18 17:12:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10630 states to 10630 states and 31231 transitions. [2019-12-18 17:12:33,969 INFO L78 Accepts]: Start accepts. Automaton has 10630 states and 31231 transitions. Word has length 67 [2019-12-18 17:12:33,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:33,969 INFO L462 AbstractCegarLoop]: Abstraction has 10630 states and 31231 transitions. [2019-12-18 17:12:33,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:12:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 10630 states and 31231 transitions. [2019-12-18 17:12:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:12:33,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:33,979 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:12:33,979 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:33,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:33,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 3 times [2019-12-18 17:12:33,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:33,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518303092] [2019-12-18 17:12:33,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:12:34,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518303092] [2019-12-18 17:12:34,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:34,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:12:34,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499111766] [2019-12-18 17:12:34,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:12:34,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:34,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:12:34,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:12:34,172 INFO L87 Difference]: Start difference. First operand 10630 states and 31231 transitions. Second operand 11 states. [2019-12-18 17:12:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:35,664 INFO L93 Difference]: Finished difference Result 16471 states and 47694 transitions. [2019-12-18 17:12:35,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:12:35,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 17:12:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:35,683 INFO L225 Difference]: With dead ends: 16471 [2019-12-18 17:12:35,683 INFO L226 Difference]: Without dead ends: 13525 [2019-12-18 17:12:35,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:12:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13525 states. [2019-12-18 17:12:35,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13525 to 10318. [2019-12-18 17:12:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10318 states. [2019-12-18 17:12:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10318 states to 10318 states and 30351 transitions. [2019-12-18 17:12:35,868 INFO L78 Accepts]: Start accepts. Automaton has 10318 states and 30351 transitions. Word has length 67 [2019-12-18 17:12:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:35,868 INFO L462 AbstractCegarLoop]: Abstraction has 10318 states and 30351 transitions. [2019-12-18 17:12:35,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:12:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 10318 states and 30351 transitions. [2019-12-18 17:12:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:12:35,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:35,879 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:12:35,879 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:35,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:35,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 4 times [2019-12-18 17:12:35,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:35,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273533922] [2019-12-18 17:12:35,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:36,049 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-18 17:12:36,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273533922] [2019-12-18 17:12:36,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:36,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:12:36,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467287178] [2019-12-18 17:12:36,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:12:36,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:36,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:12:36,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:12:36,051 INFO L87 Difference]: Start difference. First operand 10318 states and 30351 transitions. Second operand 11 states. [2019-12-18 17:12:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:37,051 INFO L93 Difference]: Finished difference Result 14907 states and 43571 transitions. [2019-12-18 17:12:37,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 17:12:37,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 17:12:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:37,075 INFO L225 Difference]: With dead ends: 14907 [2019-12-18 17:12:37,075 INFO L226 Difference]: Without dead ends: 13888 [2019-12-18 17:12:37,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 17:12:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13888 states. [2019-12-18 17:12:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13888 to 11960. [2019-12-18 17:12:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11960 states. [2019-12-18 17:12:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11960 states to 11960 states and 35086 transitions. [2019-12-18 17:12:37,292 INFO L78 Accepts]: Start accepts. Automaton has 11960 states and 35086 transitions. Word has length 67 [2019-12-18 17:12:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:37,292 INFO L462 AbstractCegarLoop]: Abstraction has 11960 states and 35086 transitions. [2019-12-18 17:12:37,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:12:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 11960 states and 35086 transitions. [2019-12-18 17:12:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:12:37,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:37,304 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:12:37,304 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1250353067, now seen corresponding path program 5 times [2019-12-18 17:12:37,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:37,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784402001] [2019-12-18 17:12:37,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:37,522 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-18 17:12:37,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784402001] [2019-12-18 17:12:37,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:37,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:12:37,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884870651] [2019-12-18 17:12:37,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:12:37,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:37,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:12:37,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:12:37,524 INFO L87 Difference]: Start difference. First operand 11960 states and 35086 transitions. Second operand 11 states. [2019-12-18 17:12:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:38,570 INFO L93 Difference]: Finished difference Result 14366 states and 41556 transitions. [2019-12-18 17:12:38,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:12:38,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 17:12:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:38,592 INFO L225 Difference]: With dead ends: 14366 [2019-12-18 17:12:38,593 INFO L226 Difference]: Without dead ends: 12148 [2019-12-18 17:12:38,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:12:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12148 states. [2019-12-18 17:12:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12148 to 9900. [2019-12-18 17:12:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9900 states. [2019-12-18 17:12:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9900 states to 9900 states and 29090 transitions. [2019-12-18 17:12:38,844 INFO L78 Accepts]: Start accepts. Automaton has 9900 states and 29090 transitions. Word has length 67 [2019-12-18 17:12:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:38,844 INFO L462 AbstractCegarLoop]: Abstraction has 9900 states and 29090 transitions. [2019-12-18 17:12:38,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:12:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9900 states and 29090 transitions. [2019-12-18 17:12:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:12:38,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:38,859 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:12:38,859 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 6 times [2019-12-18 17:12:38,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:38,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330883927] [2019-12-18 17:12:38,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:12:39,280 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-18 17:12:39,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330883927] [2019-12-18 17:12:39,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:12:39,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:12:39,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510073204] [2019-12-18 17:12:39,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 17:12:39,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:12:39,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 17:12:39,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:12:39,282 INFO L87 Difference]: Start difference. First operand 9900 states and 29090 transitions. Second operand 15 states. [2019-12-18 17:12:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:12:41,668 INFO L93 Difference]: Finished difference Result 12377 states and 35673 transitions. [2019-12-18 17:12:41,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 17:12:41,669 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 17:12:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:12:41,685 INFO L225 Difference]: With dead ends: 12377 [2019-12-18 17:12:41,685 INFO L226 Difference]: Without dead ends: 12148 [2019-12-18 17:12:41,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 17:12:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12148 states. [2019-12-18 17:12:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12148 to 9940. [2019-12-18 17:12:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9940 states. [2019-12-18 17:12:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9940 states to 9940 states and 29212 transitions. [2019-12-18 17:12:41,847 INFO L78 Accepts]: Start accepts. Automaton has 9940 states and 29212 transitions. Word has length 67 [2019-12-18 17:12:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:12:41,847 INFO L462 AbstractCegarLoop]: Abstraction has 9940 states and 29212 transitions. [2019-12-18 17:12:41,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 17:12:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 9940 states and 29212 transitions. [2019-12-18 17:12:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:12:41,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:12:41,858 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:12:41,858 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:12:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:12:41,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 7 times [2019-12-18 17:12:41,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:12:41,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001223732] [2019-12-18 17:12:41,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:12:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:12:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:12:41,971 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:12:41,971 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:12:41,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25|) 0) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_25| 4)) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_25|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25| 1) |v_#valid_65|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_25|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-18 17:12:41,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-18 17:12:41,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-18 17:12:41,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~x~0_In1665331234 ~__unbuffered_p0_EAX~0_Out1665331234) (= ~b$r_buff1_thd1~0_Out1665331234 ~b$r_buff0_thd1~0_In1665331234) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1665331234 0)) (= ~b$r_buff0_thd2~0_In1665331234 ~b$r_buff1_thd2~0_Out1665331234) (= ~b$r_buff1_thd3~0_Out1665331234 ~b$r_buff0_thd3~0_In1665331234) (= ~b$r_buff0_thd0~0_In1665331234 ~b$r_buff1_thd0~0_Out1665331234) (= 1 ~b$r_buff0_thd1~0_Out1665331234)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1665331234, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1665331234, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1665331234, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1665331234, ~x~0=~x~0_In1665331234, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1665331234} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1665331234, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1665331234, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1665331234, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1665331234, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out1665331234, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out1665331234, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1665331234, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out1665331234, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out1665331234, ~x~0=~x~0_In1665331234, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1665331234} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-18 17:12:41,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff1_used~0_In1128710905 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In1128710905 256)))) (or (and (or .cse0 .cse1) (= ~b~0_In1128710905 |P1Thread1of1ForFork0_#t~ite9_Out1128710905|)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out1128710905| ~b$w_buff1~0_In1128710905) (not .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1128710905, ~b~0=~b~0_In1128710905, ~b$w_buff1~0=~b$w_buff1~0_In1128710905, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1128710905} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1128710905, ~b~0=~b~0_In1128710905, ~b$w_buff1~0=~b$w_buff1~0_In1128710905, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1128710905|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1128710905} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 17:12:41,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 17:12:41,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In663504215 256))) (.cse0 (= (mod ~b$r_buff0_thd2~0_In663504215 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite11_Out663504215|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In663504215 |P1Thread1of1ForFork0_#t~ite11_Out663504215|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In663504215, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In663504215} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In663504215, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In663504215, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out663504215|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 17:12:41,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In69112855 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In69112855 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd2~0_In69112855 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In69112855 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$w_buff1_used~0_In69112855 |P1Thread1of1ForFork0_#t~ite12_Out69112855|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out69112855|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In69112855, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In69112855, ~b$w_buff1_used~0=~b$w_buff1_used~0_In69112855, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In69112855} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In69112855, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In69112855, ~b$w_buff1_used~0=~b$w_buff1_used~0_In69112855, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out69112855|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In69112855} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 17:12:41,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd2~0_In1293529099 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1293529099 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1293529099|) (not .cse1)) (and (= ~b$r_buff0_thd2~0_In1293529099 |P1Thread1of1ForFork0_#t~ite13_Out1293529099|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1293529099, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1293529099} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1293529099, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1293529099, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1293529099|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 17:12:41,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In-1827789519 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1827789519 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd2~0_In-1827789519 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In-1827789519 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-1827789519|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~b$r_buff1_thd2~0_In-1827789519 |P1Thread1of1ForFork0_#t~ite14_Out-1827789519|) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1827789519, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1827789519, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1827789519, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1827789519} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1827789519, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1827789519, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1827789519, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1827789519|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1827789519} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 17:12:41,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 17:12:41,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-608868650 256)))) (or (and (let ((.cse0 (= (mod ~b$r_buff0_thd3~0_In-608868650 256) 0))) (or (and .cse0 (= 0 (mod ~b$w_buff1_used~0_In-608868650 256))) (and (= 0 (mod ~b$r_buff1_thd3~0_In-608868650 256)) .cse0) (= 0 (mod ~b$w_buff0_used~0_In-608868650 256)))) (= ~b$w_buff0~0_In-608868650 |P2Thread1of1ForFork1_#t~ite20_Out-608868650|) .cse1 (= |P2Thread1of1ForFork1_#t~ite20_Out-608868650| |P2Thread1of1ForFork1_#t~ite21_Out-608868650|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite20_In-608868650| |P2Thread1of1ForFork1_#t~ite20_Out-608868650|) (= ~b$w_buff0~0_In-608868650 |P2Thread1of1ForFork1_#t~ite21_Out-608868650|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-608868650, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-608868650, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-608868650|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-608868650, ~b$w_buff0~0=~b$w_buff0~0_In-608868650, ~weak$$choice2~0=~weak$$choice2~0_In-608868650, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-608868650} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-608868650, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-608868650, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-608868650|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-608868650|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-608868650, ~b$w_buff0~0=~b$w_buff0~0_In-608868650, ~weak$$choice2~0=~weak$$choice2~0_In-608868650, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-608868650} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 17:12:41,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-739131878 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_Out-739131878| |P2Thread1of1ForFork1_#t~ite27_Out-739131878|) (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-739131878 256)))) (or (= 0 (mod ~b$w_buff0_used~0_In-739131878 256)) (and (= (mod ~b$w_buff1_used~0_In-739131878 256) 0) .cse0) (and (= (mod ~b$r_buff1_thd3~0_In-739131878 256) 0) .cse0))) (= ~b$w_buff0_used~0_In-739131878 |P2Thread1of1ForFork1_#t~ite26_Out-739131878|) .cse1) (and (= |P2Thread1of1ForFork1_#t~ite26_In-739131878| |P2Thread1of1ForFork1_#t~ite26_Out-739131878|) (not .cse1) (= ~b$w_buff0_used~0_In-739131878 |P2Thread1of1ForFork1_#t~ite27_Out-739131878|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-739131878, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-739131878, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-739131878|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-739131878, ~weak$$choice2~0=~weak$$choice2~0_In-739131878, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-739131878} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-739131878, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-739131878|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-739131878, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-739131878|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-739131878, ~weak$$choice2~0=~weak$$choice2~0_In-739131878, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-739131878} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-18 17:12:41,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 17:12:41,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-18 17:12:41,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-1287091474 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In-1287091474 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out-1287091474| ~b$w_buff1~0_In-1287091474) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite38_Out-1287091474| ~b~0_In-1287091474) (or .cse1 .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1287091474, ~b~0=~b~0_In-1287091474, ~b$w_buff1~0=~b$w_buff1~0_In-1287091474, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1287091474} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1287091474|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1287091474, ~b~0=~b~0_In-1287091474, ~b$w_buff1~0=~b$w_buff1~0_In-1287091474, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1287091474} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-18 17:12:41,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-18 17:12:41,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-497064030 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-497064030 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-497064030|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-497064030 |P2Thread1of1ForFork1_#t~ite40_Out-497064030|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-497064030, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-497064030} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-497064030, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-497064030, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-497064030|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 17:12:41,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1589021952 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1589021952 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd3~0_In-1589021952 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-1589021952 256) 0))) (or (and (= ~b$w_buff1_used~0_In-1589021952 |P2Thread1of1ForFork1_#t~ite41_Out-1589021952|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite41_Out-1589021952|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1589021952, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1589021952, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1589021952, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1589021952} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1589021952, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1589021952, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1589021952, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1589021952|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1589021952} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-18 17:12:41,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1452727224 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-1452727224 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-1452727224| ~b$r_buff0_thd3~0_In-1452727224)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out-1452727224| 0) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1452727224, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1452727224} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1452727224, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1452727224, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1452727224|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-18 17:12:41,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-2021951023 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-2021951023 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-2021951023 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd3~0_In-2021951023 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out-2021951023|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite43_Out-2021951023| ~b$r_buff1_thd3~0_In-2021951023) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2021951023, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2021951023, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2021951023, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2021951023} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2021951023, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2021951023, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-2021951023|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2021951023, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2021951023} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 17:12:41,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 17:12:41,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd1~0_In-897108457 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In-897108457 256) 0))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-897108457|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-897108457 |P0Thread1of1ForFork2_#t~ite5_Out-897108457|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-897108457, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-897108457} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-897108457, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-897108457, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-897108457|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:12:41,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In-856396807 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-856396807 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-856396807 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd1~0_In-856396807 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$w_buff1_used~0_In-856396807 |P0Thread1of1ForFork2_#t~ite6_Out-856396807|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-856396807|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-856396807, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-856396807, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-856396807, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-856396807} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-856396807, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-856396807, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-856396807, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-856396807, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-856396807|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:12:41,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-799476023 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-799476023 256) 0))) (or (and (not .cse0) (= ~b$r_buff0_thd1~0_Out-799476023 0) (not .cse1)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd1~0_In-799476023 ~b$r_buff0_thd1~0_Out-799476023)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-799476023, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-799476023} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-799476023, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-799476023, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-799476023|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:12:41,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~b$r_buff0_thd1~0_In-1334961565 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In-1334961565 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd1~0_In-1334961565 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1334961565 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-1334961565|)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite8_Out-1334961565| ~b$r_buff1_thd1~0_In-1334961565) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1334961565, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1334961565, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1334961565, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1334961565} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1334961565, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1334961565, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1334961565, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1334961565, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1334961565|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:12:41,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 17:12:41,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:12:41,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-1177301660 256) 0)) (.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In-1177301660 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1177301660| ~b$w_buff1~0_In-1177301660)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1177301660| ~b~0_In-1177301660)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1177301660, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1177301660, ~b~0=~b~0_In-1177301660, ~b$w_buff1~0=~b$w_buff1~0_In-1177301660} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1177301660, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1177301660, ~b~0=~b~0_In-1177301660, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1177301660|, ~b$w_buff1~0=~b$w_buff1~0_In-1177301660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 17:12:41,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:12:41,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-834373130 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-834373130 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-834373130| ~b$w_buff0_used~0_In-834373130) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-834373130| 0) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-834373130, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-834373130} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-834373130, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-834373130|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-834373130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 17:12:42,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In2041073950 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In2041073950 256))) (.cse3 (= (mod ~b$r_buff1_thd0~0_In2041073950 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In2041073950 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out2041073950|)) (and (= ~b$w_buff1_used~0_In2041073950 |ULTIMATE.start_main_#t~ite50_Out2041073950|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2041073950, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2041073950, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2041073950, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2041073950} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2041073950|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In2041073950, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2041073950, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2041073950, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2041073950} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 17:12:42,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1785301099 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In1785301099 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1785301099|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1785301099| ~b$r_buff0_thd0~0_In1785301099)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1785301099, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1785301099} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1785301099, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1785301099|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1785301099} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 17:12:42,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff0_used~0_In-531514978 256))) (.cse2 (= (mod ~b$r_buff0_thd0~0_In-531514978 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In-531514978 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-531514978 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-531514978| ~b$r_buff1_thd0~0_In-531514978) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-531514978| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-531514978, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-531514978, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-531514978, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-531514978} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-531514978, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-531514978|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-531514978, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-531514978, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-531514978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 17:12:42,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:12:42,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:12:42 BasicIcfg [2019-12-18 17:12:42,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:12:42,091 INFO L168 Benchmark]: Toolchain (without parser) took 112800.10 ms. Allocated memory was 137.9 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 99.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 17:12:42,092 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:12:42,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.24 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 154.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:12:42,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.80 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:12:42,092 INFO L168 Benchmark]: Boogie Preprocessor took 56.94 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:12:42,093 INFO L168 Benchmark]: RCFGBuilder took 1044.45 ms. Allocated memory is still 201.9 MB. Free memory was 150.1 MB in the beginning and 98.8 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:12:42,093 INFO L168 Benchmark]: TraceAbstraction took 110859.16 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 17:12:42,095 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.33 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.24 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 154.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.80 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.94 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1044.45 ms. Allocated memory is still 201.9 MB. Free memory was 150.1 MB in the beginning and 98.8 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 110859.16 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 110.5s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 37.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7298 SDtfs, 12344 SDslu, 26214 SDs, 0 SdLazy, 15402 SolverSat, 595 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 74 SyntacticMatches, 20 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 193666 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1609 ConstructedInterpolants, 0 QuantifiedInterpolants, 364673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...