/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/safe024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:53:17,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:53:17,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:53:17,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:53:17,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:53:17,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:53:17,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:53:17,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:53:17,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:53:17,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:53:17,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:53:17,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:53:17,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:53:17,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:53:17,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:53:17,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:53:17,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:53:17,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:53:17,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:53:17,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:53:17,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:53:17,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:53:17,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:53:17,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:53:17,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:53:17,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:53:17,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:53:17,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:53:17,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:53:17,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:53:17,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:53:17,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:53:17,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:53:17,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:53:17,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:53:17,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:53:17,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:53:17,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:53:17,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:53:17,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:53:17,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:53:17,083 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 18:53:17,099 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:53:17,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:53:17,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:53:17,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:53:17,101 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:53:17,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:53:17,101 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:53:17,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:53:17,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:53:17,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:53:17,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:53:17,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:53:17,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:53:17,102 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:53:17,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:53:17,103 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:53:17,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:53:17,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:53:17,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:53:17,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:53:17,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:53:17,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:53:17,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:53:17,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:53:17,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:53:17,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:53:17,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:53:17,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:53:17,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:53:17,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:53:17,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:53:17,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:53:17,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:53:17,408 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:53:17,409 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2019-12-18 18:53:17,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c060ea77/c3c082f6d4754ffba7d7ee982aad5d69/FLAGfae2c88ef [2019-12-18 18:53:18,067 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:53:18,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2019-12-18 18:53:18,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c060ea77/c3c082f6d4754ffba7d7ee982aad5d69/FLAGfae2c88ef [2019-12-18 18:53:18,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c060ea77/c3c082f6d4754ffba7d7ee982aad5d69 [2019-12-18 18:53:18,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:53:18,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:53:18,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:53:18,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:53:18,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:53:18,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:53:18" (1/1) ... [2019-12-18 18:53:18,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c8690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:18, skipping insertion in model container [2019-12-18 18:53:18,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:53:18" (1/1) ... [2019-12-18 18:53:18,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:53:18,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:53:18,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:53:18,984 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:53:19,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:53:19,153 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:53:19,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19 WrapperNode [2019-12-18 18:53:19,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:53:19,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:53:19,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:53:19,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:53:19,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (1/1) ... [2019-12-18 18:53:19,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (1/1) ... [2019-12-18 18:53:19,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:53:19,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:53:19,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:53:19,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:53:19,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (1/1) ... [2019-12-18 18:53:19,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (1/1) ... [2019-12-18 18:53:19,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (1/1) ... [2019-12-18 18:53:19,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (1/1) ... [2019-12-18 18:53:19,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (1/1) ... [2019-12-18 18:53:19,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (1/1) ... [2019-12-18 18:53:19,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (1/1) ... [2019-12-18 18:53:19,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:53:19,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:53:19,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:53:19,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:53:19,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (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 18:53:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:53:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:53:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:53:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:53:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:53:19,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:53:19,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:53:19,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:53:19,333 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:53:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:53:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:53:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:53:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:53:19,338 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 18:53:20,123 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:53:20,124 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:53:20,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:53:20 BoogieIcfgContainer [2019-12-18 18:53:20,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:53:20,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:53:20,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:53:20,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:53:20,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:53:18" (1/3) ... [2019-12-18 18:53:20,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a2ab72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:53:20, skipping insertion in model container [2019-12-18 18:53:20,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:53:19" (2/3) ... [2019-12-18 18:53:20,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a2ab72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:53:20, skipping insertion in model container [2019-12-18 18:53:20,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:53:20" (3/3) ... [2019-12-18 18:53:20,139 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.oepc.i [2019-12-18 18:53:20,151 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:53:20,151 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:53:20,159 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:53:20,160 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:53:20,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,203 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,203 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,230 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,254 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,254 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,263 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,270 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,271 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:53:20,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:53:20,317 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:53:20,317 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:53:20,318 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:53:20,318 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:53:20,318 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:53:20,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:53:20,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:53:20,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:53:20,336 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 18:53:20,338 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:53:20,422 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:53:20,422 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:53:20,442 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:53:20,466 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:53:20,551 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:53:20,551 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:53:20,566 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:53:20,589 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 18:53:20,590 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:53:26,440 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 18:53:26,561 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 18:53:26,588 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-18 18:53:26,588 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 18:53:26,592 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-18 18:53:38,774 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 18:53:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 18:53:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:53:38,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:38,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:53:38,784 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:38,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:38,791 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-18 18:53:38,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:38,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217182219] [2019-12-18 18:53:38,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:39,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 18:53:39,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217182219] [2019-12-18 18:53:39,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:39,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:53:39,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289455009] [2019-12-18 18:53:39,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:53:39,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:39,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:53:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:53:39,077 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 18:53:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:41,902 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-18 18:53:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:53:41,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:53:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:42,495 INFO L225 Difference]: With dead ends: 87834 [2019-12-18 18:53:42,495 INFO L226 Difference]: Without dead ends: 82738 [2019-12-18 18:53:42,497 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 18:53:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-18 18:53:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-18 18:53:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-18 18:53:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-18 18:53:50,321 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-18 18:53:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:50,321 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-18 18:53:50,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:53:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-18 18:53:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:53:50,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:50,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:50,335 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-18 18:53:50,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:50,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234288181] [2019-12-18 18:53:50,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:50,468 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 18:53:50,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234288181] [2019-12-18 18:53:50,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:50,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:53:50,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121798308] [2019-12-18 18:53:50,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:53:50,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:50,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:53:50,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:53:50,472 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-18 18:53:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:54,173 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-18 18:53:54,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:53:54,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:53:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:54,895 INFO L225 Difference]: With dead ends: 127286 [2019-12-18 18:53:54,896 INFO L226 Difference]: Without dead ends: 127202 [2019-12-18 18:53:54,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 18:53:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-18 18:54:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-18 18:54:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-18 18:54:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-18 18:54:07,464 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-18 18:54:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:07,465 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-18 18:54:07,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:54:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-18 18:54:07,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:54:07,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:07,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:54:07,471 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:07,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:07,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-18 18:54:07,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:07,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274639021] [2019-12-18 18:54:07,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:07,524 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 18:54:07,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274639021] [2019-12-18 18:54:07,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:07,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:54:07,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83802071] [2019-12-18 18:54:07,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:54:07,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:07,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:54:07,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:54:07,527 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-18 18:54:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:07,638 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-18 18:54:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:54:07,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:54:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:07,687 INFO L225 Difference]: With dead ends: 28492 [2019-12-18 18:54:07,687 INFO L226 Difference]: Without dead ends: 28492 [2019-12-18 18:54:07,688 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 18:54:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-18 18:54:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-18 18:54:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-18 18:54:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-18 18:54:08,337 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-18 18:54:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:08,337 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-18 18:54:08,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:54:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-18 18:54:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:54:08,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:08,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:54:08,340 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-18 18:54:08,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:08,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817786422] [2019-12-18 18:54:08,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:08,535 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 18:54:08,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817786422] [2019-12-18 18:54:08,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:08,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:54:08,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463247779] [2019-12-18 18:54:08,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:54:08,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:08,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:54:08,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:54:08,538 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-18 18:54:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:09,066 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-18 18:54:09,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:54:09,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 18:54:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:09,139 INFO L225 Difference]: With dead ends: 41156 [2019-12-18 18:54:09,139 INFO L226 Difference]: Without dead ends: 41141 [2019-12-18 18:54:09,140 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 18:54:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-18 18:54:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-18 18:54:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-18 18:54:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-18 18:54:11,222 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-18 18:54:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:11,223 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-18 18:54:11,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:54:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-18 18:54:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:54:11,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:11,235 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 18:54:11,236 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:11,236 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-18 18:54:11,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:11,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614009001] [2019-12-18 18:54:11,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:11,429 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 18:54:11,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614009001] [2019-12-18 18:54:11,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:11,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:54:11,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364368754] [2019-12-18 18:54:11,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:54:11,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:54:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:54:11,431 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 8 states. [2019-12-18 18:54:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:12,492 INFO L93 Difference]: Finished difference Result 48171 states and 157719 transitions. [2019-12-18 18:54:12,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:54:12,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 18:54:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:12,573 INFO L225 Difference]: With dead ends: 48171 [2019-12-18 18:54:12,573 INFO L226 Difference]: Without dead ends: 48157 [2019-12-18 18:54:12,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:54:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48157 states. [2019-12-18 18:54:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48157 to 31596. [2019-12-18 18:54:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31596 states. [2019-12-18 18:54:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31596 states to 31596 states and 105222 transitions. [2019-12-18 18:54:15,754 INFO L78 Accepts]: Start accepts. Automaton has 31596 states and 105222 transitions. Word has length 22 [2019-12-18 18:54:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:15,754 INFO L462 AbstractCegarLoop]: Abstraction has 31596 states and 105222 transitions. [2019-12-18 18:54:15,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:54:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31596 states and 105222 transitions. [2019-12-18 18:54:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:54:15,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:15,764 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 18:54:15,764 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:15,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:15,765 INFO L82 PathProgramCache]: Analyzing trace with hash 552377370, now seen corresponding path program 2 times [2019-12-18 18:54:15,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:15,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571843923] [2019-12-18 18:54:15,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:15,929 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 18:54:15,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571843923] [2019-12-18 18:54:15,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:15,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:54:15,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155968752] [2019-12-18 18:54:15,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:54:15,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:54:15,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:54:15,933 INFO L87 Difference]: Start difference. First operand 31596 states and 105222 transitions. Second operand 6 states. [2019-12-18 18:54:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:16,691 INFO L93 Difference]: Finished difference Result 50504 states and 164652 transitions. [2019-12-18 18:54:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:54:16,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:54:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:16,784 INFO L225 Difference]: With dead ends: 50504 [2019-12-18 18:54:16,784 INFO L226 Difference]: Without dead ends: 50489 [2019-12-18 18:54:16,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:54:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50489 states. [2019-12-18 18:54:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50489 to 33912. [2019-12-18 18:54:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33912 states. [2019-12-18 18:54:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33912 states to 33912 states and 112011 transitions. [2019-12-18 18:54:17,492 INFO L78 Accepts]: Start accepts. Automaton has 33912 states and 112011 transitions. Word has length 22 [2019-12-18 18:54:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:17,492 INFO L462 AbstractCegarLoop]: Abstraction has 33912 states and 112011 transitions. [2019-12-18 18:54:17,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:54:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 33912 states and 112011 transitions. [2019-12-18 18:54:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:54:17,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:17,502 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 18:54:17,502 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:17,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:17,502 INFO L82 PathProgramCache]: Analyzing trace with hash -324366654, now seen corresponding path program 1 times [2019-12-18 18:54:17,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:17,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64619542] [2019-12-18 18:54:17,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:17,662 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 18:54:17,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64619542] [2019-12-18 18:54:17,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:17,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:54:17,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545832041] [2019-12-18 18:54:17,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:54:17,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:17,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:54:17,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:54:17,664 INFO L87 Difference]: Start difference. First operand 33912 states and 112011 transitions. Second operand 6 states. [2019-12-18 18:54:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:18,744 INFO L93 Difference]: Finished difference Result 58332 states and 188079 transitions. [2019-12-18 18:54:18,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:54:18,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:54:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:18,848 INFO L225 Difference]: With dead ends: 58332 [2019-12-18 18:54:18,848 INFO L226 Difference]: Without dead ends: 58317 [2019-12-18 18:54:18,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:54:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58317 states. [2019-12-18 18:54:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58317 to 39114. [2019-12-18 18:54:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39114 states. [2019-12-18 18:54:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39114 states to 39114 states and 127576 transitions. [2019-12-18 18:54:19,640 INFO L78 Accepts]: Start accepts. Automaton has 39114 states and 127576 transitions. Word has length 22 [2019-12-18 18:54:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:19,641 INFO L462 AbstractCegarLoop]: Abstraction has 39114 states and 127576 transitions. [2019-12-18 18:54:19,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:54:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 39114 states and 127576 transitions. [2019-12-18 18:54:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:54:19,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:19,650 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 18:54:19,650 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1455790486, now seen corresponding path program 3 times [2019-12-18 18:54:19,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:19,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495241847] [2019-12-18 18:54:19,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:19,772 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 18:54:19,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495241847] [2019-12-18 18:54:19,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:19,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:54:19,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419436052] [2019-12-18 18:54:19,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:54:19,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:19,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:54:19,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:54:19,774 INFO L87 Difference]: Start difference. First operand 39114 states and 127576 transitions. Second operand 7 states. [2019-12-18 18:54:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:20,882 INFO L93 Difference]: Finished difference Result 57661 states and 185585 transitions. [2019-12-18 18:54:20,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:54:20,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 18:54:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:20,985 INFO L225 Difference]: With dead ends: 57661 [2019-12-18 18:54:20,986 INFO L226 Difference]: Without dead ends: 57646 [2019-12-18 18:54:20,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:54:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57646 states. [2019-12-18 18:54:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57646 to 37466. [2019-12-18 18:54:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37466 states. [2019-12-18 18:54:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37466 states to 37466 states and 122495 transitions. [2019-12-18 18:54:22,119 INFO L78 Accepts]: Start accepts. Automaton has 37466 states and 122495 transitions. Word has length 22 [2019-12-18 18:54:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:22,119 INFO L462 AbstractCegarLoop]: Abstraction has 37466 states and 122495 transitions. [2019-12-18 18:54:22,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:54:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 37466 states and 122495 transitions. [2019-12-18 18:54:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:54:22,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:22,133 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 18:54:22,133 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-18 18:54:22,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:22,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631537832] [2019-12-18 18:54:22,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:22,169 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 18:54:22,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631537832] [2019-12-18 18:54:22,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:22,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:54:22,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819914586] [2019-12-18 18:54:22,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:54:22,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:22,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:54:22,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:54:22,171 INFO L87 Difference]: Start difference. First operand 37466 states and 122495 transitions. Second operand 4 states. [2019-12-18 18:54:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:22,251 INFO L93 Difference]: Finished difference Result 14641 states and 44308 transitions. [2019-12-18 18:54:22,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:54:22,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:54:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:22,284 INFO L225 Difference]: With dead ends: 14641 [2019-12-18 18:54:22,284 INFO L226 Difference]: Without dead ends: 14641 [2019-12-18 18:54:22,285 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 18:54:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14641 states. [2019-12-18 18:54:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14641 to 14486. [2019-12-18 18:54:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14486 states. [2019-12-18 18:54:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14486 states to 14486 states and 43853 transitions. [2019-12-18 18:54:22,517 INFO L78 Accepts]: Start accepts. Automaton has 14486 states and 43853 transitions. Word has length 25 [2019-12-18 18:54:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:22,517 INFO L462 AbstractCegarLoop]: Abstraction has 14486 states and 43853 transitions. [2019-12-18 18:54:22,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:54:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 14486 states and 43853 transitions. [2019-12-18 18:54:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:54:22,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:22,536 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 18:54:22,536 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:22,537 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-18 18:54:22,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:22,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627860388] [2019-12-18 18:54:22,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:22,599 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 18:54:22,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627860388] [2019-12-18 18:54:22,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:22,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:54:22,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707990713] [2019-12-18 18:54:22,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:54:22,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:22,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:54:22,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:54:22,601 INFO L87 Difference]: Start difference. First operand 14486 states and 43853 transitions. Second operand 5 states. [2019-12-18 18:54:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:22,679 INFO L93 Difference]: Finished difference Result 13120 states and 40364 transitions. [2019-12-18 18:54:22,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:54:22,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 18:54:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:22,702 INFO L225 Difference]: With dead ends: 13120 [2019-12-18 18:54:22,703 INFO L226 Difference]: Without dead ends: 13120 [2019-12-18 18:54:22,703 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 18:54:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-12-18 18:54:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 12654. [2019-12-18 18:54:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12654 states. [2019-12-18 18:54:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 39049 transitions. [2019-12-18 18:54:22,903 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 39049 transitions. Word has length 39 [2019-12-18 18:54:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:22,904 INFO L462 AbstractCegarLoop]: Abstraction has 12654 states and 39049 transitions. [2019-12-18 18:54:22,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:54:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 39049 transitions. [2019-12-18 18:54:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:54:22,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:22,923 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] [2019-12-18 18:54:22,923 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-18 18:54:22,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:22,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198776680] [2019-12-18 18:54:22,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:23,007 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 18:54:23,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198776680] [2019-12-18 18:54:23,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:23,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:54:23,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719838363] [2019-12-18 18:54:23,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:54:23,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:54:23,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:54:23,011 INFO L87 Difference]: Start difference. First operand 12654 states and 39049 transitions. Second operand 4 states. [2019-12-18 18:54:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:23,107 INFO L93 Difference]: Finished difference Result 23069 states and 71102 transitions. [2019-12-18 18:54:23,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:54:23,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 18:54:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:23,123 INFO L225 Difference]: With dead ends: 23069 [2019-12-18 18:54:23,124 INFO L226 Difference]: Without dead ends: 11042 [2019-12-18 18:54:23,124 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 18:54:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11042 states. [2019-12-18 18:54:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11042 to 11042. [2019-12-18 18:54:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11042 states. [2019-12-18 18:54:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11042 states to 11042 states and 33895 transitions. [2019-12-18 18:54:23,287 INFO L78 Accepts]: Start accepts. Automaton has 11042 states and 33895 transitions. Word has length 53 [2019-12-18 18:54:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:23,287 INFO L462 AbstractCegarLoop]: Abstraction has 11042 states and 33895 transitions. [2019-12-18 18:54:23,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:54:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11042 states and 33895 transitions. [2019-12-18 18:54:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:54:23,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:23,305 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] [2019-12-18 18:54:23,305 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:23,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:23,305 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-18 18:54:23,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:23,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769136390] [2019-12-18 18:54:23,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:23,396 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 18:54:23,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769136390] [2019-12-18 18:54:23,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:23,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:54:23,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614192390] [2019-12-18 18:54:23,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:54:23,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:23,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:54:23,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:54:23,398 INFO L87 Difference]: Start difference. First operand 11042 states and 33895 transitions. Second operand 7 states. [2019-12-18 18:54:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:23,988 INFO L93 Difference]: Finished difference Result 26731 states and 81978 transitions. [2019-12-18 18:54:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:54:23,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:54:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:24,032 INFO L225 Difference]: With dead ends: 26731 [2019-12-18 18:54:24,032 INFO L226 Difference]: Without dead ends: 21825 [2019-12-18 18:54:24,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:54:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21825 states. [2019-12-18 18:54:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21825 to 12839. [2019-12-18 18:54:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12839 states. [2019-12-18 18:54:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12839 states to 12839 states and 39761 transitions. [2019-12-18 18:54:24,336 INFO L78 Accepts]: Start accepts. Automaton has 12839 states and 39761 transitions. Word has length 53 [2019-12-18 18:54:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:24,336 INFO L462 AbstractCegarLoop]: Abstraction has 12839 states and 39761 transitions. [2019-12-18 18:54:24,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:54:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 12839 states and 39761 transitions. [2019-12-18 18:54:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:54:24,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:24,350 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] [2019-12-18 18:54:24,351 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:24,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-18 18:54:24,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:24,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914281834] [2019-12-18 18:54:24,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:24,430 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 18:54:24,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914281834] [2019-12-18 18:54:24,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:24,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:54:24,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843845714] [2019-12-18 18:54:24,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:54:24,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:24,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:54:24,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:54:24,432 INFO L87 Difference]: Start difference. First operand 12839 states and 39761 transitions. Second operand 7 states. [2019-12-18 18:54:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:24,892 INFO L93 Difference]: Finished difference Result 33675 states and 101714 transitions. [2019-12-18 18:54:24,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:54:24,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:54:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:24,942 INFO L225 Difference]: With dead ends: 33675 [2019-12-18 18:54:24,943 INFO L226 Difference]: Without dead ends: 23645 [2019-12-18 18:54:24,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:54:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23645 states. [2019-12-18 18:54:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23645 to 14877. [2019-12-18 18:54:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14877 states. [2019-12-18 18:54:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14877 states to 14877 states and 45900 transitions. [2019-12-18 18:54:25,245 INFO L78 Accepts]: Start accepts. Automaton has 14877 states and 45900 transitions. Word has length 53 [2019-12-18 18:54:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:25,246 INFO L462 AbstractCegarLoop]: Abstraction has 14877 states and 45900 transitions. [2019-12-18 18:54:25,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:54:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 14877 states and 45900 transitions. [2019-12-18 18:54:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:54:25,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:25,261 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] [2019-12-18 18:54:25,261 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:25,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-18 18:54:25,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:25,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048200950] [2019-12-18 18:54:25,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:25,343 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 18:54:25,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048200950] [2019-12-18 18:54:25,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:25,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:54:25,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124275778] [2019-12-18 18:54:25,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:54:25,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:25,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:54:25,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:54:25,345 INFO L87 Difference]: Start difference. First operand 14877 states and 45900 transitions. Second operand 7 states. [2019-12-18 18:54:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:25,765 INFO L93 Difference]: Finished difference Result 29447 states and 90372 transitions. [2019-12-18 18:54:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:54:25,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:54:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:25,808 INFO L225 Difference]: With dead ends: 29447 [2019-12-18 18:54:25,808 INFO L226 Difference]: Without dead ends: 27476 [2019-12-18 18:54:25,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:54:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27476 states. [2019-12-18 18:54:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27476 to 14943. [2019-12-18 18:54:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2019-12-18 18:54:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 46185 transitions. [2019-12-18 18:54:26,119 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 46185 transitions. Word has length 53 [2019-12-18 18:54:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:26,120 INFO L462 AbstractCegarLoop]: Abstraction has 14943 states and 46185 transitions. [2019-12-18 18:54:26,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:54:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 46185 transitions. [2019-12-18 18:54:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:54:26,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:26,137 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] [2019-12-18 18:54:26,137 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-18 18:54:26,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:26,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927474237] [2019-12-18 18:54:26,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:26,193 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 18:54:26,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927474237] [2019-12-18 18:54:26,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:26,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:54:26,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044426402] [2019-12-18 18:54:26,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:54:26,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:26,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:54:26,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:54:26,196 INFO L87 Difference]: Start difference. First operand 14943 states and 46185 transitions. Second operand 3 states. [2019-12-18 18:54:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:26,312 INFO L93 Difference]: Finished difference Result 20151 states and 62759 transitions. [2019-12-18 18:54:26,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:54:26,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:54:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:26,361 INFO L225 Difference]: With dead ends: 20151 [2019-12-18 18:54:26,361 INFO L226 Difference]: Without dead ends: 20151 [2019-12-18 18:54:26,364 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 18:54:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2019-12-18 18:54:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 16555. [2019-12-18 18:54:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16555 states. [2019-12-18 18:54:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16555 states to 16555 states and 52509 transitions. [2019-12-18 18:54:27,059 INFO L78 Accepts]: Start accepts. Automaton has 16555 states and 52509 transitions. Word has length 53 [2019-12-18 18:54:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:27,061 INFO L462 AbstractCegarLoop]: Abstraction has 16555 states and 52509 transitions. [2019-12-18 18:54:27,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:54:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 16555 states and 52509 transitions. [2019-12-18 18:54:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:54:27,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:27,092 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] [2019-12-18 18:54:27,092 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-18 18:54:27,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:27,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182191445] [2019-12-18 18:54:27,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:27,213 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 18:54:27,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182191445] [2019-12-18 18:54:27,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:27,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:54:27,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454144341] [2019-12-18 18:54:27,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:54:27,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:27,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:54:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:54:27,215 INFO L87 Difference]: Start difference. First operand 16555 states and 52509 transitions. Second operand 6 states. [2019-12-18 18:54:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:27,928 INFO L93 Difference]: Finished difference Result 31129 states and 96493 transitions. [2019-12-18 18:54:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:54:27,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 18:54:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:27,977 INFO L225 Difference]: With dead ends: 31129 [2019-12-18 18:54:27,977 INFO L226 Difference]: Without dead ends: 31045 [2019-12-18 18:54:27,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:54:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31045 states. [2019-12-18 18:54:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31045 to 19566. [2019-12-18 18:54:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19566 states. [2019-12-18 18:54:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19566 states to 19566 states and 61294 transitions. [2019-12-18 18:54:28,357 INFO L78 Accepts]: Start accepts. Automaton has 19566 states and 61294 transitions. Word has length 53 [2019-12-18 18:54:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:28,357 INFO L462 AbstractCegarLoop]: Abstraction has 19566 states and 61294 transitions. [2019-12-18 18:54:28,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:54:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19566 states and 61294 transitions. [2019-12-18 18:54:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:54:28,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:28,387 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] [2019-12-18 18:54:28,387 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-18 18:54:28,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:28,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284389995] [2019-12-18 18:54:28,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:28,487 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 18:54:28,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284389995] [2019-12-18 18:54:28,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:28,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:54:28,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235409013] [2019-12-18 18:54:28,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:54:28,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:28,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:54:28,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:54:28,492 INFO L87 Difference]: Start difference. First operand 19566 states and 61294 transitions. Second operand 7 states. [2019-12-18 18:54:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:29,402 INFO L93 Difference]: Finished difference Result 31592 states and 95412 transitions. [2019-12-18 18:54:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:54:29,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:54:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:29,449 INFO L225 Difference]: With dead ends: 31592 [2019-12-18 18:54:29,449 INFO L226 Difference]: Without dead ends: 31470 [2019-12-18 18:54:29,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:54:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31470 states. [2019-12-18 18:54:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31470 to 25009. [2019-12-18 18:54:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25009 states. [2019-12-18 18:54:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25009 states to 25009 states and 77193 transitions. [2019-12-18 18:54:29,887 INFO L78 Accepts]: Start accepts. Automaton has 25009 states and 77193 transitions. Word has length 53 [2019-12-18 18:54:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:29,887 INFO L462 AbstractCegarLoop]: Abstraction has 25009 states and 77193 transitions. [2019-12-18 18:54:29,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:54:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 25009 states and 77193 transitions. [2019-12-18 18:54:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:54:29,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:29,914 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] [2019-12-18 18:54:29,914 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:29,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:29,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-18 18:54:29,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:29,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062707625] [2019-12-18 18:54:29,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:30,033 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 18:54:30,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062707625] [2019-12-18 18:54:30,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:30,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:54:30,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50663182] [2019-12-18 18:54:30,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:54:30,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:54:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:54:30,036 INFO L87 Difference]: Start difference. First operand 25009 states and 77193 transitions. Second operand 9 states. [2019-12-18 18:54:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:32,008 INFO L93 Difference]: Finished difference Result 40635 states and 123380 transitions. [2019-12-18 18:54:32,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 18:54:32,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 18:54:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:32,115 INFO L225 Difference]: With dead ends: 40635 [2019-12-18 18:54:32,116 INFO L226 Difference]: Without dead ends: 40635 [2019-12-18 18:54:32,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:54:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2019-12-18 18:54:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23556. [2019-12-18 18:54:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-18 18:54:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-18 18:54:33,039 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-18 18:54:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:33,040 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-18 18:54:33,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:54:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-18 18:54:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:54:33,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:33,081 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] [2019-12-18 18:54:33,081 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:33,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:33,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-18 18:54:33,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:33,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853861050] [2019-12-18 18:54:33,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:33,188 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 18:54:33,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853861050] [2019-12-18 18:54:33,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:33,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:54:33,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027827616] [2019-12-18 18:54:33,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:54:33,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:54:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:54:33,190 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-18 18:54:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:33,303 INFO L93 Difference]: Finished difference Result 23554 states and 73039 transitions. [2019-12-18 18:54:33,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:54:33,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:54:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:33,351 INFO L225 Difference]: With dead ends: 23554 [2019-12-18 18:54:33,352 INFO L226 Difference]: Without dead ends: 23554 [2019-12-18 18:54:33,352 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 18:54:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23554 states. [2019-12-18 18:54:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23554 to 21366. [2019-12-18 18:54:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21366 states. [2019-12-18 18:54:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21366 states to 21366 states and 67157 transitions. [2019-12-18 18:54:34,050 INFO L78 Accepts]: Start accepts. Automaton has 21366 states and 67157 transitions. Word has length 53 [2019-12-18 18:54:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:34,051 INFO L462 AbstractCegarLoop]: Abstraction has 21366 states and 67157 transitions. [2019-12-18 18:54:34,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:54:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 21366 states and 67157 transitions. [2019-12-18 18:54:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:54:34,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:34,099 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] [2019-12-18 18:54:34,099 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1545980158, now seen corresponding path program 1 times [2019-12-18 18:54:34,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:34,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839752487] [2019-12-18 18:54:34,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:34,187 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 18:54:34,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839752487] [2019-12-18 18:54:34,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:34,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:54:34,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191817925] [2019-12-18 18:54:34,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:54:34,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:34,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:54:34,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:54:34,191 INFO L87 Difference]: Start difference. First operand 21366 states and 67157 transitions. Second operand 3 states. [2019-12-18 18:54:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:34,306 INFO L93 Difference]: Finished difference Result 15882 states and 48979 transitions. [2019-12-18 18:54:34,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:54:34,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:54:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:34,344 INFO L225 Difference]: With dead ends: 15882 [2019-12-18 18:54:34,345 INFO L226 Difference]: Without dead ends: 15882 [2019-12-18 18:54:34,345 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 18:54:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15882 states. [2019-12-18 18:54:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15882 to 15239. [2019-12-18 18:54:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15239 states. [2019-12-18 18:54:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15239 states to 15239 states and 46889 transitions. [2019-12-18 18:54:34,721 INFO L78 Accepts]: Start accepts. Automaton has 15239 states and 46889 transitions. Word has length 54 [2019-12-18 18:54:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:34,721 INFO L462 AbstractCegarLoop]: Abstraction has 15239 states and 46889 transitions. [2019-12-18 18:54:34,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:54:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 15239 states and 46889 transitions. [2019-12-18 18:54:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:54:34,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:34,738 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] [2019-12-18 18:54:34,738 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:34,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:34,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 1 times [2019-12-18 18:54:34,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:34,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147552986] [2019-12-18 18:54:34,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:35,154 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 18:54:35,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147552986] [2019-12-18 18:54:35,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:35,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:54:35,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781173458] [2019-12-18 18:54:35,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:54:35,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:35,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:54:35,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:54:35,156 INFO L87 Difference]: Start difference. First operand 15239 states and 46889 transitions. Second operand 15 states. [2019-12-18 18:54:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:39,620 INFO L93 Difference]: Finished difference Result 32555 states and 99352 transitions. [2019-12-18 18:54:39,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 18:54:39,625 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 18:54:39,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:39,671 INFO L225 Difference]: With dead ends: 32555 [2019-12-18 18:54:39,671 INFO L226 Difference]: Without dead ends: 32005 [2019-12-18 18:54:39,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=483, Invalid=2709, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 18:54:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32005 states. [2019-12-18 18:54:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32005 to 17929. [2019-12-18 18:54:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17929 states. [2019-12-18 18:54:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 55059 transitions. [2019-12-18 18:54:40,035 INFO L78 Accepts]: Start accepts. Automaton has 17929 states and 55059 transitions. Word has length 55 [2019-12-18 18:54:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:40,036 INFO L462 AbstractCegarLoop]: Abstraction has 17929 states and 55059 transitions. [2019-12-18 18:54:40,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:54:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 17929 states and 55059 transitions. [2019-12-18 18:54:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:54:40,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:40,053 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] [2019-12-18 18:54:40,053 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 2 times [2019-12-18 18:54:40,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:40,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743101753] [2019-12-18 18:54:40,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:40,461 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 18:54:40,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743101753] [2019-12-18 18:54:40,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:40,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:54:40,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585180373] [2019-12-18 18:54:40,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:54:40,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:40,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:54:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:54:40,467 INFO L87 Difference]: Start difference. First operand 17929 states and 55059 transitions. Second operand 15 states. [2019-12-18 18:54:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:44,643 INFO L93 Difference]: Finished difference Result 32383 states and 98463 transitions. [2019-12-18 18:54:44,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 18:54:44,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 18:54:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:44,682 INFO L225 Difference]: With dead ends: 32383 [2019-12-18 18:54:44,682 INFO L226 Difference]: Without dead ends: 27651 [2019-12-18 18:54:44,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=393, Invalid=1769, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 18:54:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27651 states. [2019-12-18 18:54:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27651 to 15907. [2019-12-18 18:54:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15907 states. [2019-12-18 18:54:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15907 states to 15907 states and 48594 transitions. [2019-12-18 18:54:44,978 INFO L78 Accepts]: Start accepts. Automaton has 15907 states and 48594 transitions. Word has length 55 [2019-12-18 18:54:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:44,978 INFO L462 AbstractCegarLoop]: Abstraction has 15907 states and 48594 transitions. [2019-12-18 18:54:44,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:54:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 15907 states and 48594 transitions. [2019-12-18 18:54:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:54:44,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:44,994 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] [2019-12-18 18:54:44,994 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1698448247, now seen corresponding path program 3 times [2019-12-18 18:54:44,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:44,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967479219] [2019-12-18 18:54:44,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:45,380 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 18:54:45,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967479219] [2019-12-18 18:54:45,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:45,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:54:45,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132639600] [2019-12-18 18:54:45,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:54:45,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:45,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:54:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:54:45,386 INFO L87 Difference]: Start difference. First operand 15907 states and 48594 transitions. Second operand 15 states. [2019-12-18 18:54:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:49,326 INFO L93 Difference]: Finished difference Result 29614 states and 89687 transitions. [2019-12-18 18:54:49,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 18:54:49,327 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 18:54:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:49,367 INFO L225 Difference]: With dead ends: 29614 [2019-12-18 18:54:49,367 INFO L226 Difference]: Without dead ends: 27636 [2019-12-18 18:54:49,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=514, Invalid=2566, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 18:54:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27636 states. [2019-12-18 18:54:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27636 to 16003. [2019-12-18 18:54:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16003 states. [2019-12-18 18:54:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16003 states to 16003 states and 48866 transitions. [2019-12-18 18:54:49,677 INFO L78 Accepts]: Start accepts. Automaton has 16003 states and 48866 transitions. Word has length 55 [2019-12-18 18:54:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:49,677 INFO L462 AbstractCegarLoop]: Abstraction has 16003 states and 48866 transitions. [2019-12-18 18:54:49,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:54:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 16003 states and 48866 transitions. [2019-12-18 18:54:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:54:49,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:49,693 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] [2019-12-18 18:54:49,693 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 4 times [2019-12-18 18:54:49,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:49,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660898463] [2019-12-18 18:54:49,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:50,043 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 18:54:50,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660898463] [2019-12-18 18:54:50,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:50,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:54:50,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554034484] [2019-12-18 18:54:50,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:54:50,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:50,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:54:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:54:50,047 INFO L87 Difference]: Start difference. First operand 16003 states and 48866 transitions. Second operand 15 states. [2019-12-18 18:54:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:54,085 INFO L93 Difference]: Finished difference Result 27652 states and 83603 transitions. [2019-12-18 18:54:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 18:54:54,087 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 18:54:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:54,126 INFO L225 Difference]: With dead ends: 27652 [2019-12-18 18:54:54,126 INFO L226 Difference]: Without dead ends: 27360 [2019-12-18 18:54:54,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 18:54:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27360 states. [2019-12-18 18:54:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27360 to 15859. [2019-12-18 18:54:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15859 states. [2019-12-18 18:54:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15859 states to 15859 states and 48470 transitions. [2019-12-18 18:54:54,433 INFO L78 Accepts]: Start accepts. Automaton has 15859 states and 48470 transitions. Word has length 55 [2019-12-18 18:54:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:54:54,433 INFO L462 AbstractCegarLoop]: Abstraction has 15859 states and 48470 transitions. [2019-12-18 18:54:54,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:54:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 15859 states and 48470 transitions. [2019-12-18 18:54:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:54:54,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:54:54,448 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] [2019-12-18 18:54:54,449 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:54:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:54:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1449339733, now seen corresponding path program 5 times [2019-12-18 18:54:54,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:54:54,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819487166] [2019-12-18 18:54:54,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:54:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:54:54,929 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 18:54:54,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819487166] [2019-12-18 18:54:54,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:54:54,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:54:54,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663918661] [2019-12-18 18:54:54,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:54:54,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:54:54,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:54:54,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:54:54,931 INFO L87 Difference]: Start difference. First operand 15859 states and 48470 transitions. Second operand 15 states. [2019-12-18 18:54:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:54:59,816 INFO L93 Difference]: Finished difference Result 37265 states and 113332 transitions. [2019-12-18 18:54:59,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 18:54:59,816 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 18:54:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:54:59,871 INFO L225 Difference]: With dead ends: 37265 [2019-12-18 18:54:59,871 INFO L226 Difference]: Without dead ends: 36579 [2019-12-18 18:54:59,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 18:54:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36579 states. [2019-12-18 18:55:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36579 to 20534. [2019-12-18 18:55:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20534 states. [2019-12-18 18:55:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20534 states to 20534 states and 62847 transitions. [2019-12-18 18:55:00,429 INFO L78 Accepts]: Start accepts. Automaton has 20534 states and 62847 transitions. Word has length 55 [2019-12-18 18:55:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:00,429 INFO L462 AbstractCegarLoop]: Abstraction has 20534 states and 62847 transitions. [2019-12-18 18:55:00,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:55:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 20534 states and 62847 transitions. [2019-12-18 18:55:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:55:00,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:00,450 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] [2019-12-18 18:55:00,450 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:00,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1045961465, now seen corresponding path program 6 times [2019-12-18 18:55:00,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:00,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098095020] [2019-12-18 18:55:00,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:00,907 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 18:55:00,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098095020] [2019-12-18 18:55:00,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:00,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:55:00,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409021817] [2019-12-18 18:55:00,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:55:00,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:00,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:55:00,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:55:00,910 INFO L87 Difference]: Start difference. First operand 20534 states and 62847 transitions. Second operand 15 states. [2019-12-18 18:55:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:04,995 INFO L93 Difference]: Finished difference Result 37219 states and 112557 transitions. [2019-12-18 18:55:04,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 18:55:04,996 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 18:55:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:05,035 INFO L225 Difference]: With dead ends: 37219 [2019-12-18 18:55:05,036 INFO L226 Difference]: Without dead ends: 26861 [2019-12-18 18:55:05,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 18:55:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26861 states. [2019-12-18 18:55:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26861 to 15696. [2019-12-18 18:55:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15696 states. [2019-12-18 18:55:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15696 states to 15696 states and 47799 transitions. [2019-12-18 18:55:05,348 INFO L78 Accepts]: Start accepts. Automaton has 15696 states and 47799 transitions. Word has length 55 [2019-12-18 18:55:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:05,349 INFO L462 AbstractCegarLoop]: Abstraction has 15696 states and 47799 transitions. [2019-12-18 18:55:05,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:55:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 15696 states and 47799 transitions. [2019-12-18 18:55:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:55:05,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:05,365 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] [2019-12-18 18:55:05,366 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash -381651263, now seen corresponding path program 7 times [2019-12-18 18:55:05,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:05,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469565140] [2019-12-18 18:55:05,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:05,894 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 18:55:05,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469565140] [2019-12-18 18:55:05,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:05,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:55:05,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671973313] [2019-12-18 18:55:05,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:55:05,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:05,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:55:05,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:55:05,896 INFO L87 Difference]: Start difference. First operand 15696 states and 47799 transitions. Second operand 16 states. [2019-12-18 18:55:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:09,373 INFO L93 Difference]: Finished difference Result 28861 states and 87422 transitions. [2019-12-18 18:55:09,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 18:55:09,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 18:55:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:09,414 INFO L225 Difference]: With dead ends: 28861 [2019-12-18 18:55:09,414 INFO L226 Difference]: Without dead ends: 28623 [2019-12-18 18:55:09,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=434, Invalid=2428, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 18:55:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28623 states. [2019-12-18 18:55:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28623 to 17568. [2019-12-18 18:55:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17568 states. [2019-12-18 18:55:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17568 states to 17568 states and 53427 transitions. [2019-12-18 18:55:09,760 INFO L78 Accepts]: Start accepts. Automaton has 17568 states and 53427 transitions. Word has length 55 [2019-12-18 18:55:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:09,760 INFO L462 AbstractCegarLoop]: Abstraction has 17568 states and 53427 transitions. [2019-12-18 18:55:09,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:55:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 17568 states and 53427 transitions. [2019-12-18 18:55:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:55:09,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:09,778 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] [2019-12-18 18:55:09,778 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:09,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash -785029531, now seen corresponding path program 8 times [2019-12-18 18:55:09,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:09,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736096809] [2019-12-18 18:55:09,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:10,217 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 18:55:10,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736096809] [2019-12-18 18:55:10,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:10,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:55:10,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928229681] [2019-12-18 18:55:10,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:55:10,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:10,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:55:10,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:55:10,219 INFO L87 Difference]: Start difference. First operand 17568 states and 53427 transitions. Second operand 16 states. [2019-12-18 18:55:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:13,889 INFO L93 Difference]: Finished difference Result 29019 states and 87556 transitions. [2019-12-18 18:55:13,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 18:55:13,890 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 18:55:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:13,926 INFO L225 Difference]: With dead ends: 29019 [2019-12-18 18:55:13,926 INFO L226 Difference]: Without dead ends: 26861 [2019-12-18 18:55:13,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=449, Invalid=2203, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 18:55:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26861 states. [2019-12-18 18:55:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26861 to 15732. [2019-12-18 18:55:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15732 states. [2019-12-18 18:55:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15732 states to 15732 states and 47877 transitions. [2019-12-18 18:55:14,217 INFO L78 Accepts]: Start accepts. Automaton has 15732 states and 47877 transitions. Word has length 55 [2019-12-18 18:55:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:14,217 INFO L462 AbstractCegarLoop]: Abstraction has 15732 states and 47877 transitions. [2019-12-18 18:55:14,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:55:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 15732 states and 47877 transitions. [2019-12-18 18:55:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:55:14,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:14,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:55:14,233 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:14,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1467868539, now seen corresponding path program 9 times [2019-12-18 18:55:14,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:14,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010059296] [2019-12-18 18:55:14,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:14,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 18:55:14,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010059296] [2019-12-18 18:55:14,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:14,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:55:14,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313392329] [2019-12-18 18:55:14,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:55:14,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:14,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:55:14,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:55:14,328 INFO L87 Difference]: Start difference. First operand 15732 states and 47877 transitions. Second operand 9 states. [2019-12-18 18:55:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:15,641 INFO L93 Difference]: Finished difference Result 26678 states and 80902 transitions. [2019-12-18 18:55:15,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 18:55:15,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 18:55:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:15,673 INFO L225 Difference]: With dead ends: 26678 [2019-12-18 18:55:15,673 INFO L226 Difference]: Without dead ends: 21926 [2019-12-18 18:55:15,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:55:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21926 states. [2019-12-18 18:55:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21926 to 15662. [2019-12-18 18:55:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15662 states. [2019-12-18 18:55:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15662 states to 15662 states and 47570 transitions. [2019-12-18 18:55:15,941 INFO L78 Accepts]: Start accepts. Automaton has 15662 states and 47570 transitions. Word has length 55 [2019-12-18 18:55:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:15,941 INFO L462 AbstractCegarLoop]: Abstraction has 15662 states and 47570 transitions. [2019-12-18 18:55:15,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:55:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15662 states and 47570 transitions. [2019-12-18 18:55:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:55:15,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:15,956 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] [2019-12-18 18:55:15,956 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash -866822381, now seen corresponding path program 10 times [2019-12-18 18:55:15,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:15,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040707514] [2019-12-18 18:55:15,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:16,114 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 18:55:16,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040707514] [2019-12-18 18:55:16,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:16,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:55:16,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253514598] [2019-12-18 18:55:16,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:55:16,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:16,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:55:16,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:55:16,116 INFO L87 Difference]: Start difference. First operand 15662 states and 47570 transitions. Second operand 11 states. [2019-12-18 18:55:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:17,141 INFO L93 Difference]: Finished difference Result 26763 states and 81664 transitions. [2019-12-18 18:55:17,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 18:55:17,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 18:55:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:17,179 INFO L225 Difference]: With dead ends: 26763 [2019-12-18 18:55:17,179 INFO L226 Difference]: Without dead ends: 26197 [2019-12-18 18:55:17,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-18 18:55:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26197 states. [2019-12-18 18:55:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26197 to 17330. [2019-12-18 18:55:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17330 states. [2019-12-18 18:55:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17330 states to 17330 states and 52722 transitions. [2019-12-18 18:55:17,471 INFO L78 Accepts]: Start accepts. Automaton has 17330 states and 52722 transitions. Word has length 55 [2019-12-18 18:55:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:17,472 INFO L462 AbstractCegarLoop]: Abstraction has 17330 states and 52722 transitions. [2019-12-18 18:55:17,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:55:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 17330 states and 52722 transitions. [2019-12-18 18:55:17,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:55:17,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:17,487 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] [2019-12-18 18:55:17,487 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:17,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:17,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1270200649, now seen corresponding path program 11 times [2019-12-18 18:55:17,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:17,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727429630] [2019-12-18 18:55:17,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:17,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 18:55:17,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727429630] [2019-12-18 18:55:17,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:17,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:55:17,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963293930] [2019-12-18 18:55:17,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:55:17,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:55:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:55:17,642 INFO L87 Difference]: Start difference. First operand 17330 states and 52722 transitions. Second operand 11 states. [2019-12-18 18:55:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:18,565 INFO L93 Difference]: Finished difference Result 26539 states and 80657 transitions. [2019-12-18 18:55:18,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 18:55:18,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 18:55:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:18,597 INFO L225 Difference]: With dead ends: 26539 [2019-12-18 18:55:18,597 INFO L226 Difference]: Without dead ends: 22779 [2019-12-18 18:55:18,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 18:55:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-12-18 18:55:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 14804. [2019-12-18 18:55:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14804 states. [2019-12-18 18:55:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14804 states to 14804 states and 45140 transitions. [2019-12-18 18:55:18,871 INFO L78 Accepts]: Start accepts. Automaton has 14804 states and 45140 transitions. Word has length 55 [2019-12-18 18:55:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:18,871 INFO L462 AbstractCegarLoop]: Abstraction has 14804 states and 45140 transitions. [2019-12-18 18:55:18,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:55:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 14804 states and 45140 transitions. [2019-12-18 18:55:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:55:18,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:18,887 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] [2019-12-18 18:55:18,887 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 12 times [2019-12-18 18:55:18,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:18,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361719222] [2019-12-18 18:55:18,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:55:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:55:19,035 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:55:19,035 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:55:19,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24| 1)) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2351~0.base_24|) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24|) |v_ULTIMATE.start_main_~#t2351~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24|)) (= 0 |v_ULTIMATE.start_main_~#t2351~0.offset_18|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_26|, ULTIMATE.start_main_~#t2351~0.offset=|v_ULTIMATE.start_main_~#t2351~0.offset_18|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ULTIMATE.start_main_~#t2351~0.base=|v_ULTIMATE.start_main_~#t2351~0.base_24|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2352~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2353~0.base, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2353~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2352~0.base, ULTIMATE.start_main_~#t2351~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2351~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:55:19,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2352~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13| 1)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2352~0.base_13|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13|) |v_ULTIMATE.start_main_~#t2352~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2352~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2352~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2352~0.base] because there is no mapped edge [2019-12-18 18:55:19,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t2353~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13|) |v_ULTIMATE.start_main_~#t2353~0.offset_11| 2)) |v_#memory_int_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2353~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2353~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2353~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2353~0.base] because there is no mapped edge [2019-12-18 18:55:19,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff0~0_In331303270 ~x$w_buff1~0_Out331303270) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out331303270| 1) (= 1 ~x$w_buff0~0_Out331303270) (= P1Thread1of1ForFork0_~arg.base_Out331303270 |P1Thread1of1ForFork0_#in~arg.base_In331303270|) (= 0 (mod ~x$w_buff1_used~0_Out331303270 256)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out331303270| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out331303270) (= ~x$w_buff0_used~0_In331303270 ~x$w_buff1_used~0_Out331303270) (= |P1Thread1of1ForFork0_#in~arg.offset_In331303270| P1Thread1of1ForFork0_~arg.offset_Out331303270) (= 1 ~x$w_buff0_used~0_Out331303270)) InVars {~x$w_buff0~0=~x$w_buff0~0_In331303270, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In331303270|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In331303270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In331303270} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out331303270, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out331303270, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out331303270, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out331303270, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out331303270|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In331303270|, ~x$w_buff1~0=~x$w_buff1~0_Out331303270, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In331303270|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out331303270, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out331303270} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 18:55:19,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1716769271 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1716769271 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1716769271| ~x$w_buff1~0_In1716769271)) (and (or .cse0 .cse1) (= ~x~0_In1716769271 |P2Thread1of1ForFork1_#t~ite32_Out1716769271|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1716769271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1716769271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1716769271, ~x~0=~x~0_In1716769271} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1716769271|, ~x$w_buff1~0=~x$w_buff1~0_In1716769271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1716769271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1716769271, ~x~0=~x~0_In1716769271} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:55:19,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:55:19,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-665841935 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-665841935 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-665841935 |P2Thread1of1ForFork1_#t~ite34_Out-665841935|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-665841935|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-665841935, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-665841935} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-665841935|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-665841935, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-665841935} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:55:19,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In8020870 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In8020870 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In8020870 |P1Thread1of1ForFork0_#t~ite28_Out8020870|)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out8020870| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In8020870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In8020870} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In8020870, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out8020870|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In8020870} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 18:55:19,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1605774295 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1605774295 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1605774295 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1605774295 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1605774295 |P1Thread1of1ForFork0_#t~ite29_Out1605774295|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1605774295|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1605774295, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1605774295, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1605774295, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1605774295} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1605774295, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1605774295, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1605774295, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1605774295|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1605774295} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 18:55:19,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1779843653 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1779843653 256)))) (or (and (= ~x$r_buff0_thd2~0_In1779843653 ~x$r_buff0_thd2~0_Out1779843653) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out1779843653) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1779843653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1779843653} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1779843653|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1779843653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1779843653} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:55:19,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1480452251 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1480452251 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1480452251 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1480452251 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1480452251 |P1Thread1of1ForFork0_#t~ite31_Out-1480452251|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1480452251|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1480452251, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1480452251, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1480452251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1480452251} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1480452251|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1480452251, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1480452251, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1480452251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1480452251} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 18:55:19,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 18:55:19,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-936650343 256) 0))) (or (and (= ~x$w_buff1~0_In-936650343 |P0Thread1of1ForFork2_#t~ite12_Out-936650343|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-936650343| |P0Thread1of1ForFork2_#t~ite11_Out-936650343|)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-936650343 256)))) (or (= (mod ~x$w_buff0_used~0_In-936650343 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-936650343 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-936650343 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite11_Out-936650343| |P0Thread1of1ForFork2_#t~ite12_Out-936650343|) (= ~x$w_buff1~0_In-936650343 |P0Thread1of1ForFork2_#t~ite11_Out-936650343|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-936650343, ~x$w_buff1~0=~x$w_buff1~0_In-936650343, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-936650343, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-936650343, ~weak$$choice2~0=~weak$$choice2~0_In-936650343, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-936650343|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-936650343} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-936650343, ~x$w_buff1~0=~x$w_buff1~0_In-936650343, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-936650343, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-936650343, ~weak$$choice2~0=~weak$$choice2~0_In-936650343, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-936650343|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-936650343|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-936650343} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 18:55:19,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-288895568 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out-288895568| ~x$w_buff0_used~0_In-288895568) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-288895568| |P0Thread1of1ForFork2_#t~ite14_Out-288895568|)) (and (= ~x$w_buff0_used~0_In-288895568 |P0Thread1of1ForFork2_#t~ite14_Out-288895568|) .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-288895568| |P0Thread1of1ForFork2_#t~ite14_Out-288895568|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-288895568 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In-288895568 256) 0) .cse1) (and (= (mod ~x$w_buff1_used~0_In-288895568 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-288895568 256) 0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-288895568, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-288895568, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-288895568, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-288895568|, ~weak$$choice2~0=~weak$$choice2~0_In-288895568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288895568} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-288895568, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-288895568, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-288895568|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-288895568, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-288895568|, ~weak$$choice2~0=~weak$$choice2~0_In-288895568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288895568} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 18:55:19,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-942789761 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out-942789761| ~x$w_buff1_used~0_In-942789761) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-942789761 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-942789761 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-942789761 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-942789761 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite17_Out-942789761| |P0Thread1of1ForFork2_#t~ite18_Out-942789761|)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out-942789761| ~x$w_buff1_used~0_In-942789761) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-942789761| |P0Thread1of1ForFork2_#t~ite17_Out-942789761|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-942789761, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-942789761|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-942789761, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-942789761, ~weak$$choice2~0=~weak$$choice2~0_In-942789761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-942789761} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-942789761, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-942789761|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-942789761|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-942789761, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-942789761, ~weak$$choice2~0=~weak$$choice2~0_In-942789761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-942789761} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:55:19,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 18:55:19,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 18:55:19,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1680615925 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1680615925 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1680615925 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1680615925 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1680615925|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1680615925 |P2Thread1of1ForFork1_#t~ite35_Out-1680615925|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680615925, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1680615925, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1680615925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680615925} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1680615925|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680615925, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1680615925, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1680615925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680615925} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:55:19,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-467328759 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-467328759 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-467328759|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-467328759| ~x$r_buff0_thd3~0_In-467328759)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-467328759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-467328759} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-467328759|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-467328759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-467328759} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:55:19,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In2128995611 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In2128995611 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In2128995611 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2128995611 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out2128995611|)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out2128995611| ~x$r_buff1_thd3~0_In2128995611) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2128995611, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2128995611, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2128995611, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128995611} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out2128995611|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2128995611, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2128995611, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2128995611, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128995611} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:55:19,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 18:55:19,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:55:19,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1867967343 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1867967343 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out1867967343| ~x$w_buff1~0_In1867967343) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1867967343| ~x~0_In1867967343) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1867967343, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1867967343, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1867967343, ~x~0=~x~0_In1867967343} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1867967343|, ~x$w_buff1~0=~x$w_buff1~0_In1867967343, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1867967343, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1867967343, ~x~0=~x~0_In1867967343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 18:55:19,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 18:55:19,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1610712355 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1610712355 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1610712355| ~x$w_buff0_used~0_In1610712355)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1610712355| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1610712355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1610712355} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1610712355, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1610712355|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1610712355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:55:19,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1960976982 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1960976982 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1960976982 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1960976982 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1960976982| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1960976982 |ULTIMATE.start_main_#t~ite44_Out1960976982|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1960976982, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1960976982, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1960976982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960976982} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1960976982, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1960976982, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1960976982, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1960976982|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960976982} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:55:19,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In885494838 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In885494838 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out885494838|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In885494838 |ULTIMATE.start_main_#t~ite45_Out885494838|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In885494838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885494838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In885494838, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out885494838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885494838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:55:19,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1553849493 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1553849493 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1553849493 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1553849493 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out-1553849493| ~x$r_buff1_thd0~0_In-1553849493)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1553849493| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1553849493, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1553849493, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1553849493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1553849493} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1553849493, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1553849493|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1553849493, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1553849493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1553849493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 18:55:19,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:55:19,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:55:19 BasicIcfg [2019-12-18 18:55:19,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:55:19,170 INFO L168 Benchmark]: Toolchain (without parser) took 120744.69 ms. Allocated memory was 145.2 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 100.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 18:55:19,173 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 18:55:19,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.47 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.6 MB in the beginning and 155.5 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:55:19,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.08 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:55:19,174 INFO L168 Benchmark]: Boogie Preprocessor took 37.85 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:55:19,175 INFO L168 Benchmark]: RCFGBuilder took 863.23 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 104.2 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:55:19,175 INFO L168 Benchmark]: TraceAbstraction took 119040.60 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 18:55:19,182 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.51 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 727.47 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.6 MB in the beginning and 155.5 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.08 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.85 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 863.23 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 104.2 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119040.60 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2351, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2352, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2353, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 55.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7802 SDtfs, 12757 SDslu, 34941 SDs, 0 SdLazy, 31832 SolverSat, 698 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 723 GetRequests, 52 SyntacticMatches, 36 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7097 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred 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: 37.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 287091 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1388 NumberOfCodeBlocks, 1388 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1302 ConstructedInterpolants, 0 QuantifiedInterpolants, 369266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...