/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:31:43,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:31:43,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:31:43,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:31:43,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:31:43,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:31:43,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:31:43,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:31:43,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:31:43,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:31:43,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:31:43,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:31:43,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:31:43,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:31:43,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:31:43,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:31:43,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:31:43,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:31:43,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:31:43,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:31:43,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:31:43,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:31:43,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:31:43,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:31:43,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:31:43,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:31:43,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:31:43,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:31:43,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:31:43,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:31:43,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:31:43,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:31:43,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:31:43,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:31:43,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:31:43,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:31:43,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:31:43,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:31:43,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:31:43,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:31:43,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:31:43,254 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-VariableLbe-MCR.epf [2019-12-27 20:31:43,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:31:43,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:31:43,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:31:43,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:31:43,270 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:31:43,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:31:43,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:31:43,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:31:43,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:31:43,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:31:43,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:31:43,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:31:43,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:31:43,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:31:43,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:31:43,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:31:43,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:31:43,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:31:43,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:31:43,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:31:43,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:31:43,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:31:43,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:31:43,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:31:43,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:31:43,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:31:43,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:31:43,275 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:31:43,275 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:31:43,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:31:43,275 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:31:43,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:31:43,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:31:43,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:31:43,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:31:43,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:31:43,567 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:31:43,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2019-12-27 20:31:43,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89e11ca8/43451ca89a8742198cf3b6ddeda077e6/FLAG4afcfa8aa [2019-12-27 20:31:44,134 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:31:44,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2019-12-27 20:31:44,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89e11ca8/43451ca89a8742198cf3b6ddeda077e6/FLAG4afcfa8aa [2019-12-27 20:31:44,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89e11ca8/43451ca89a8742198cf3b6ddeda077e6 [2019-12-27 20:31:44,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:31:44,407 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:31:44,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:31:44,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:31:44,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:31:44,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:31:44" (1/1) ... [2019-12-27 20:31:44,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e11d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:44, skipping insertion in model container [2019-12-27 20:31:44,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:31:44" (1/1) ... [2019-12-27 20:31:44,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:31:44,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:31:45,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:31:45,074 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:31:45,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:31:45,211 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:31:45,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45 WrapperNode [2019-12-27 20:31:45,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:31:45,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:31:45,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:31:45,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:31:45,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... [2019-12-27 20:31:45,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... [2019-12-27 20:31:45,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:31:45,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:31:45,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:31:45,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:31:45,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... [2019-12-27 20:31:45,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... [2019-12-27 20:31:45,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... [2019-12-27 20:31:45,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... [2019-12-27 20:31:45,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... [2019-12-27 20:31:45,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... [2019-12-27 20:31:45,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... [2019-12-27 20:31:45,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:31:45,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:31:45,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:31:45,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:31:45,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:31:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:31:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:31:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:31:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:31:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:31:45,418 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:31:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:31:45,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:31:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:31:45,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:31:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:31:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:31:45,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:31:45,423 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:31:46,347 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:31:46,348 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:31:46,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:31:46 BoogieIcfgContainer [2019-12-27 20:31:46,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:31:46,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:31:46,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:31:46,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:31:46,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:31:44" (1/3) ... [2019-12-27 20:31:46,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954aa50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:31:46, skipping insertion in model container [2019-12-27 20:31:46,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:45" (2/3) ... [2019-12-27 20:31:46,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954aa50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:31:46, skipping insertion in model container [2019-12-27 20:31:46,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:31:46" (3/3) ... [2019-12-27 20:31:46,358 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.oepc.i [2019-12-27 20:31:46,369 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:31:46,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:31:46,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:31:46,379 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:31:46,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,433 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,468 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,469 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,480 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,481 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,529 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:46,567 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:31:46,588 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:31:46,588 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:31:46,589 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:31:46,589 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:31:46,589 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:31:46,589 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:31:46,589 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:31:46,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:31:46,607 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 20:31:46,609 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 20:31:46,742 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 20:31:46,742 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:31:46,762 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:31:46,785 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 20:31:46,842 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 20:31:46,842 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:31:46,851 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:31:46,873 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:31:46,874 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:31:50,440 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 20:31:50,598 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:31:50,624 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82648 [2019-12-27 20:31:50,624 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 20:31:50,628 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-27 20:32:13,379 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 20:32:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 20:32:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:32:13,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:13,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:32:13,388 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:13,394 INFO L82 PathProgramCache]: Analyzing trace with hash 914072, now seen corresponding path program 1 times [2019-12-27 20:32:13,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:13,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627559095] [2019-12-27 20:32:13,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:13,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627559095] [2019-12-27 20:32:13,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:13,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:32:13,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2020029990] [2019-12-27 20:32:13,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:13,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:13,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:32:13,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:13,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:13,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:32:13,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:32:13,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:13,724 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 20:32:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:17,989 INFO L93 Difference]: Finished difference Result 128056 states and 545104 transitions. [2019-12-27 20:32:17,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:32:17,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:32:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:18,620 INFO L225 Difference]: With dead ends: 128056 [2019-12-27 20:32:18,623 INFO L226 Difference]: Without dead ends: 120020 [2019-12-27 20:32:18,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120020 states. [2019-12-27 20:32:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120020 to 120020. [2019-12-27 20:32:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120020 states. [2019-12-27 20:32:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120020 states to 120020 states and 510230 transitions. [2019-12-27 20:32:29,574 INFO L78 Accepts]: Start accepts. Automaton has 120020 states and 510230 transitions. Word has length 3 [2019-12-27 20:32:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:29,575 INFO L462 AbstractCegarLoop]: Abstraction has 120020 states and 510230 transitions. [2019-12-27 20:32:29,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:32:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 120020 states and 510230 transitions. [2019-12-27 20:32:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:32:29,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:29,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:29,581 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:29,581 INFO L82 PathProgramCache]: Analyzing trace with hash 634457403, now seen corresponding path program 1 times [2019-12-27 20:32:29,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:29,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910345916] [2019-12-27 20:32:29,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:29,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910345916] [2019-12-27 20:32:29,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:29,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:29,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526092868] [2019-12-27 20:32:29,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:29,674 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:29,677 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:32:29,677 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:29,677 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:29,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:32:29,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:29,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:32:29,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:32:29,680 INFO L87 Difference]: Start difference. First operand 120020 states and 510230 transitions. Second operand 4 states. [2019-12-27 20:32:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:34,982 INFO L93 Difference]: Finished difference Result 186650 states and 761123 transitions. [2019-12-27 20:32:34,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:32:34,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:32:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:35,727 INFO L225 Difference]: With dead ends: 186650 [2019-12-27 20:32:35,727 INFO L226 Difference]: Without dead ends: 186601 [2019-12-27 20:32:35,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186601 states. [2019-12-27 20:32:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186601 to 170989. [2019-12-27 20:32:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170989 states. [2019-12-27 20:32:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170989 states to 170989 states and 706730 transitions. [2019-12-27 20:32:46,536 INFO L78 Accepts]: Start accepts. Automaton has 170989 states and 706730 transitions. Word has length 11 [2019-12-27 20:32:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:46,537 INFO L462 AbstractCegarLoop]: Abstraction has 170989 states and 706730 transitions. [2019-12-27 20:32:46,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:32:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 170989 states and 706730 transitions. [2019-12-27 20:32:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:32:46,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:46,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:46,545 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:46,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash 401091072, now seen corresponding path program 1 times [2019-12-27 20:32:46,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:46,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983790621] [2019-12-27 20:32:46,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:46,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983790621] [2019-12-27 20:32:46,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:46,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:46,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1822062695] [2019-12-27 20:32:46,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:46,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:46,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:32:46,605 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:46,606 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:46,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:32:46,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:46,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:32:46,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:46,607 INFO L87 Difference]: Start difference. First operand 170989 states and 706730 transitions. Second operand 3 states. [2019-12-27 20:32:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:46,758 INFO L93 Difference]: Finished difference Result 36488 states and 117956 transitions. [2019-12-27 20:32:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:32:46,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:32:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:46,817 INFO L225 Difference]: With dead ends: 36488 [2019-12-27 20:32:46,818 INFO L226 Difference]: Without dead ends: 36488 [2019-12-27 20:32:46,818 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-27 20:32:52,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36488 states. [2019-12-27 20:32:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36488 to 36488. [2019-12-27 20:32:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36488 states. [2019-12-27 20:32:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36488 states to 36488 states and 117956 transitions. [2019-12-27 20:32:52,963 INFO L78 Accepts]: Start accepts. Automaton has 36488 states and 117956 transitions. Word has length 13 [2019-12-27 20:32:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:52,963 INFO L462 AbstractCegarLoop]: Abstraction has 36488 states and 117956 transitions. [2019-12-27 20:32:52,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:32:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 36488 states and 117956 transitions. [2019-12-27 20:32:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:32:52,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:52,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:52,967 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:52,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1042189126, now seen corresponding path program 1 times [2019-12-27 20:32:52,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:52,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101702666] [2019-12-27 20:32:52,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:53,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101702666] [2019-12-27 20:32:53,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:53,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:32:53,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958704836] [2019-12-27 20:32:53,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:53,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:53,069 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:32:53,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:53,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:53,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:53,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:53,070 INFO L87 Difference]: Start difference. First operand 36488 states and 117956 transitions. Second operand 5 states. [2019-12-27 20:32:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:53,549 INFO L93 Difference]: Finished difference Result 49379 states and 157671 transitions. [2019-12-27 20:32:53,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:32:53,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:32:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:53,628 INFO L225 Difference]: With dead ends: 49379 [2019-12-27 20:32:53,628 INFO L226 Difference]: Without dead ends: 49379 [2019-12-27 20:32:53,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:32:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49379 states. [2019-12-27 20:32:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49379 to 41803. [2019-12-27 20:32:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41803 states. [2019-12-27 20:32:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41803 states to 41803 states and 134583 transitions. [2019-12-27 20:32:54,750 INFO L78 Accepts]: Start accepts. Automaton has 41803 states and 134583 transitions. Word has length 16 [2019-12-27 20:32:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:54,750 INFO L462 AbstractCegarLoop]: Abstraction has 41803 states and 134583 transitions. [2019-12-27 20:32:54,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 41803 states and 134583 transitions. [2019-12-27 20:32:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:32:54,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:54,762 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-27 20:32:54,762 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1062845656, now seen corresponding path program 1 times [2019-12-27 20:32:54,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:54,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848260783] [2019-12-27 20:32:54,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:54,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848260783] [2019-12-27 20:32:54,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:54,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:32:54,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1519276281] [2019-12-27 20:32:54,869 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:54,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:54,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 20:32:54,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:54,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:32:54,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:32:54,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:54,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:32:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:32:54,923 INFO L87 Difference]: Start difference. First operand 41803 states and 134583 transitions. Second operand 7 states. [2019-12-27 20:32:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:56,034 INFO L93 Difference]: Finished difference Result 61952 states and 194620 transitions. [2019-12-27 20:32:56,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:32:56,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 20:32:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:56,142 INFO L225 Difference]: With dead ends: 61952 [2019-12-27 20:32:56,142 INFO L226 Difference]: Without dead ends: 61945 [2019-12-27 20:32:56,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:32:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61945 states. [2019-12-27 20:32:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61945 to 42202. [2019-12-27 20:32:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42202 states. [2019-12-27 20:32:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42202 states to 42202 states and 134980 transitions. [2019-12-27 20:32:57,573 INFO L78 Accepts]: Start accepts. Automaton has 42202 states and 134980 transitions. Word has length 22 [2019-12-27 20:32:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:57,573 INFO L462 AbstractCegarLoop]: Abstraction has 42202 states and 134980 transitions. [2019-12-27 20:32:57,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:32:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 42202 states and 134980 transitions. [2019-12-27 20:32:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:32:57,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:57,589 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-27 20:32:57,589 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:57,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:57,590 INFO L82 PathProgramCache]: Analyzing trace with hash 389254536, now seen corresponding path program 1 times [2019-12-27 20:32:57,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:57,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712397618] [2019-12-27 20:32:57,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:57,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712397618] [2019-12-27 20:32:57,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:57,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:32:57,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1196462882] [2019-12-27 20:32:57,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:57,668 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:57,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:32:57,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:57,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:32:57,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:57,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:57,693 INFO L87 Difference]: Start difference. First operand 42202 states and 134980 transitions. Second operand 5 states. [2019-12-27 20:32:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:57,808 INFO L93 Difference]: Finished difference Result 17764 states and 53552 transitions. [2019-12-27 20:32:57,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:32:57,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:32:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:57,847 INFO L225 Difference]: With dead ends: 17764 [2019-12-27 20:32:57,848 INFO L226 Difference]: Without dead ends: 17764 [2019-12-27 20:32:57,848 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-27 20:32:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17764 states. [2019-12-27 20:32:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17764 to 17380. [2019-12-27 20:32:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17380 states. [2019-12-27 20:32:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17380 states to 17380 states and 52512 transitions. [2019-12-27 20:32:58,127 INFO L78 Accepts]: Start accepts. Automaton has 17380 states and 52512 transitions. Word has length 25 [2019-12-27 20:32:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:58,127 INFO L462 AbstractCegarLoop]: Abstraction has 17380 states and 52512 transitions. [2019-12-27 20:32:58,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 17380 states and 52512 transitions. [2019-12-27 20:32:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:32:58,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:58,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:58,141 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash -565342962, now seen corresponding path program 1 times [2019-12-27 20:32:58,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:58,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517960201] [2019-12-27 20:32:58,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:58,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517960201] [2019-12-27 20:32:58,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:58,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:32:58,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [806447445] [2019-12-27 20:32:58,237 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:58,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:58,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:32:58,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:58,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:58,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:32:58,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:58,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:32:58,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:32:58,251 INFO L87 Difference]: Start difference. First operand 17380 states and 52512 transitions. Second operand 6 states. [2019-12-27 20:32:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:58,783 INFO L93 Difference]: Finished difference Result 24778 states and 73126 transitions. [2019-12-27 20:32:58,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:32:58,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 20:32:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:58,826 INFO L225 Difference]: With dead ends: 24778 [2019-12-27 20:32:58,827 INFO L226 Difference]: Without dead ends: 24778 [2019-12-27 20:32:58,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:32:58,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24778 states. [2019-12-27 20:32:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24778 to 19837. [2019-12-27 20:32:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19837 states. [2019-12-27 20:32:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19837 states to 19837 states and 59751 transitions. [2019-12-27 20:32:59,202 INFO L78 Accepts]: Start accepts. Automaton has 19837 states and 59751 transitions. Word has length 27 [2019-12-27 20:32:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:59,203 INFO L462 AbstractCegarLoop]: Abstraction has 19837 states and 59751 transitions. [2019-12-27 20:32:59,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:32:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 19837 states and 59751 transitions. [2019-12-27 20:32:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:32:59,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:59,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:59,223 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:59,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash -26145312, now seen corresponding path program 1 times [2019-12-27 20:32:59,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:59,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015731684] [2019-12-27 20:32:59,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:59,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015731684] [2019-12-27 20:32:59,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:59,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:32:59,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566819676] [2019-12-27 20:32:59,333 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:59,339 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:59,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 20:32:59,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:59,372 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:32:59,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:32:59,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:32:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:32:59,373 INFO L87 Difference]: Start difference. First operand 19837 states and 59751 transitions. Second operand 8 states. [2019-12-27 20:33:00,505 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 20:33:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:00,864 INFO L93 Difference]: Finished difference Result 27047 states and 79356 transitions. [2019-12-27 20:33:00,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:33:00,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 20:33:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:00,902 INFO L225 Difference]: With dead ends: 27047 [2019-12-27 20:33:00,902 INFO L226 Difference]: Without dead ends: 27047 [2019-12-27 20:33:00,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:33:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27047 states. [2019-12-27 20:33:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27047 to 18334. [2019-12-27 20:33:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18334 states. [2019-12-27 20:33:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18334 states to 18334 states and 55114 transitions. [2019-12-27 20:33:01,232 INFO L78 Accepts]: Start accepts. Automaton has 18334 states and 55114 transitions. Word has length 33 [2019-12-27 20:33:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:01,232 INFO L462 AbstractCegarLoop]: Abstraction has 18334 states and 55114 transitions. [2019-12-27 20:33:01,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:33:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18334 states and 55114 transitions. [2019-12-27 20:33:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:33:01,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:01,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:01,257 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1777489015, now seen corresponding path program 1 times [2019-12-27 20:33:01,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:01,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121730982] [2019-12-27 20:33:01,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:01,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121730982] [2019-12-27 20:33:01,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:01,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:33:01,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53287630] [2019-12-27 20:33:01,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:01,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:01,383 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 211 transitions. [2019-12-27 20:33:01,383 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:01,384 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:33:01,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:33:01,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:01,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:33:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:33:01,385 INFO L87 Difference]: Start difference. First operand 18334 states and 55114 transitions. Second operand 3 states. [2019-12-27 20:33:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:01,458 INFO L93 Difference]: Finished difference Result 18333 states and 55112 transitions. [2019-12-27 20:33:01,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:33:01,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:33:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:01,491 INFO L225 Difference]: With dead ends: 18333 [2019-12-27 20:33:01,492 INFO L226 Difference]: Without dead ends: 18333 [2019-12-27 20:33:01,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:33:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-27 20:33:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 18333. [2019-12-27 20:33:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18333 states. [2019-12-27 20:33:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18333 states to 18333 states and 55112 transitions. [2019-12-27 20:33:01,779 INFO L78 Accepts]: Start accepts. Automaton has 18333 states and 55112 transitions. Word has length 39 [2019-12-27 20:33:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:01,780 INFO L462 AbstractCegarLoop]: Abstraction has 18333 states and 55112 transitions. [2019-12-27 20:33:01,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:33:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 18333 states and 55112 transitions. [2019-12-27 20:33:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:33:01,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:01,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:01,804 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash 51869366, now seen corresponding path program 1 times [2019-12-27 20:33:01,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:01,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105364789] [2019-12-27 20:33:01,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:01,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105364789] [2019-12-27 20:33:01,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:01,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:33:01,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1299162434] [2019-12-27 20:33:01,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:01,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:01,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 164 transitions. [2019-12-27 20:33:01,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:01,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:33:01,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:33:01,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:01,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:33:01,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:33:01,938 INFO L87 Difference]: Start difference. First operand 18333 states and 55112 transitions. Second operand 6 states. [2019-12-27 20:33:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:02,070 INFO L93 Difference]: Finished difference Result 30242 states and 91634 transitions. [2019-12-27 20:33:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:33:02,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 20:33:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:02,093 INFO L225 Difference]: With dead ends: 30242 [2019-12-27 20:33:02,093 INFO L226 Difference]: Without dead ends: 15767 [2019-12-27 20:33:02,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:33:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15767 states. [2019-12-27 20:33:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15767 to 15693. [2019-12-27 20:33:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15693 states. [2019-12-27 20:33:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15693 states to 15693 states and 46442 transitions. [2019-12-27 20:33:02,335 INFO L78 Accepts]: Start accepts. Automaton has 15693 states and 46442 transitions. Word has length 40 [2019-12-27 20:33:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:02,335 INFO L462 AbstractCegarLoop]: Abstraction has 15693 states and 46442 transitions. [2019-12-27 20:33:02,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:33:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 15693 states and 46442 transitions. [2019-12-27 20:33:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:33:02,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:02,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:02,351 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:02,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash 573984020, now seen corresponding path program 2 times [2019-12-27 20:33:02,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:02,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512143974] [2019-12-27 20:33:02,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:02,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512143974] [2019-12-27 20:33:02,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:02,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:33:02,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1876978072] [2019-12-27 20:33:02,412 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:02,495 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:02,528 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 148 transitions. [2019-12-27 20:33:02,528 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:02,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:33:02,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:33:02,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:33:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:33:02,542 INFO L87 Difference]: Start difference. First operand 15693 states and 46442 transitions. Second operand 4 states. [2019-12-27 20:33:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:02,799 INFO L93 Difference]: Finished difference Result 29593 states and 88296 transitions. [2019-12-27 20:33:02,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:33:02,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 20:33:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:02,825 INFO L225 Difference]: With dead ends: 29593 [2019-12-27 20:33:02,825 INFO L226 Difference]: Without dead ends: 16033 [2019-12-27 20:33:02,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 20:33:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16033 states. [2019-12-27 20:33:03,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16033 to 11531. [2019-12-27 20:33:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11531 states. [2019-12-27 20:33:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11531 states to 11531 states and 33132 transitions. [2019-12-27 20:33:03,041 INFO L78 Accepts]: Start accepts. Automaton has 11531 states and 33132 transitions. Word has length 40 [2019-12-27 20:33:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:03,041 INFO L462 AbstractCegarLoop]: Abstraction has 11531 states and 33132 transitions. [2019-12-27 20:33:03,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:33:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 11531 states and 33132 transitions. [2019-12-27 20:33:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:33:03,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:03,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:03,055 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:03,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 974597418, now seen corresponding path program 3 times [2019-12-27 20:33:03,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:03,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130870195] [2019-12-27 20:33:03,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:03,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130870195] [2019-12-27 20:33:03,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:03,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:33:03,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1166189134] [2019-12-27 20:33:03,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:03,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:03,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 20:33:03,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:03,253 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:33:03,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:33:03,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:03,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:33:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:33:03,254 INFO L87 Difference]: Start difference. First operand 11531 states and 33132 transitions. Second operand 7 states. [2019-12-27 20:33:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:03,331 INFO L93 Difference]: Finished difference Result 10699 states and 31268 transitions. [2019-12-27 20:33:03,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:33:03,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 20:33:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:03,345 INFO L225 Difference]: With dead ends: 10699 [2019-12-27 20:33:03,345 INFO L226 Difference]: Without dead ends: 6792 [2019-12-27 20:33:03,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:33:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6792 states. [2019-12-27 20:33:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6792 to 6792. [2019-12-27 20:33:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6792 states. [2019-12-27 20:33:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6792 states to 6792 states and 22017 transitions. [2019-12-27 20:33:03,479 INFO L78 Accepts]: Start accepts. Automaton has 6792 states and 22017 transitions. Word has length 40 [2019-12-27 20:33:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:03,479 INFO L462 AbstractCegarLoop]: Abstraction has 6792 states and 22017 transitions. [2019-12-27 20:33:03,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:33:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6792 states and 22017 transitions. [2019-12-27 20:33:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:03,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:03,487 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1875886253, now seen corresponding path program 1 times [2019-12-27 20:33:03,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:03,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930970848] [2019-12-27 20:33:03,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:03,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930970848] [2019-12-27 20:33:03,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:03,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:33:03,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1049130053] [2019-12-27 20:33:03,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:03,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:03,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 480 transitions. [2019-12-27 20:33:03,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:04,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:33:04,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:33:04,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:04,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:33:04,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:33:04,028 INFO L87 Difference]: Start difference. First operand 6792 states and 22017 transitions. Second operand 13 states. [2019-12-27 20:33:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:05,792 INFO L93 Difference]: Finished difference Result 20704 states and 64618 transitions. [2019-12-27 20:33:05,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:33:05,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 20:33:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:05,818 INFO L225 Difference]: With dead ends: 20704 [2019-12-27 20:33:05,818 INFO L226 Difference]: Without dead ends: 15522 [2019-12-27 20:33:05,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:33:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15522 states. [2019-12-27 20:33:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15522 to 8280. [2019-12-27 20:33:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8280 states. [2019-12-27 20:33:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 26738 transitions. [2019-12-27 20:33:06,016 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 26738 transitions. Word has length 64 [2019-12-27 20:33:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:06,016 INFO L462 AbstractCegarLoop]: Abstraction has 8280 states and 26738 transitions. [2019-12-27 20:33:06,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:33:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 26738 transitions. [2019-12-27 20:33:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:06,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:06,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:06,026 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash -233855723, now seen corresponding path program 2 times [2019-12-27 20:33:06,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:06,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273077310] [2019-12-27 20:33:06,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:06,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273077310] [2019-12-27 20:33:06,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:06,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:33:06,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1717287665] [2019-12-27 20:33:06,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:06,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:06,402 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 267 states and 507 transitions. [2019-12-27 20:33:06,402 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:06,581 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:33:06,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:33:06,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:06,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:33:06,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:33:06,583 INFO L87 Difference]: Start difference. First operand 8280 states and 26738 transitions. Second operand 13 states. [2019-12-27 20:33:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:07,028 INFO L93 Difference]: Finished difference Result 15353 states and 48447 transitions. [2019-12-27 20:33:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:33:07,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 20:33:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:07,046 INFO L225 Difference]: With dead ends: 15353 [2019-12-27 20:33:07,046 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 20:33:07,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:33:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 20:33:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 9382. [2019-12-27 20:33:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9382 states. [2019-12-27 20:33:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9382 states to 9382 states and 30156 transitions. [2019-12-27 20:33:07,222 INFO L78 Accepts]: Start accepts. Automaton has 9382 states and 30156 transitions. Word has length 64 [2019-12-27 20:33:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:07,222 INFO L462 AbstractCegarLoop]: Abstraction has 9382 states and 30156 transitions. [2019-12-27 20:33:07,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:33:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 9382 states and 30156 transitions. [2019-12-27 20:33:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:07,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:07,235 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:07,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:07,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1270827741, now seen corresponding path program 3 times [2019-12-27 20:33:07,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:07,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707580106] [2019-12-27 20:33:07,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:07,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707580106] [2019-12-27 20:33:07,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:07,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:33:07,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138404342] [2019-12-27 20:33:07,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:07,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:07,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 268 states and 502 transitions. [2019-12-27 20:33:07,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:08,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 20:33:08,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:33:08,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:08,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:33:08,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:33:08,251 INFO L87 Difference]: Start difference. First operand 9382 states and 30156 transitions. Second operand 13 states. [2019-12-27 20:33:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:11,253 INFO L93 Difference]: Finished difference Result 73078 states and 233787 transitions. [2019-12-27 20:33:11,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 20:33:11,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 20:33:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:11,389 INFO L225 Difference]: With dead ends: 73078 [2019-12-27 20:33:11,390 INFO L226 Difference]: Without dead ends: 55345 [2019-12-27 20:33:11,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 23 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=839, Invalid=2701, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 20:33:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55345 states. [2019-12-27 20:33:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55345 to 12804. [2019-12-27 20:33:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12804 states. [2019-12-27 20:33:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12804 states to 12804 states and 41705 transitions. [2019-12-27 20:33:12,034 INFO L78 Accepts]: Start accepts. Automaton has 12804 states and 41705 transitions. Word has length 64 [2019-12-27 20:33:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:12,034 INFO L462 AbstractCegarLoop]: Abstraction has 12804 states and 41705 transitions. [2019-12-27 20:33:12,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:33:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 12804 states and 41705 transitions. [2019-12-27 20:33:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:12,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:12,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:12,051 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1888227633, now seen corresponding path program 4 times [2019-12-27 20:33:12,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:12,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161205462] [2019-12-27 20:33:12,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:12,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161205462] [2019-12-27 20:33:12,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:12,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:33:12,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507903462] [2019-12-27 20:33:12,142 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:12,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:12,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 241 states and 441 transitions. [2019-12-27 20:33:12,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:12,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:33:12,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:33:12,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:12,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:33:12,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:33:12,465 INFO L87 Difference]: Start difference. First operand 12804 states and 41705 transitions. Second operand 5 states. [2019-12-27 20:33:12,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:12,763 INFO L93 Difference]: Finished difference Result 14489 states and 46408 transitions. [2019-12-27 20:33:12,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:33:12,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 20:33:12,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:12,787 INFO L225 Difference]: With dead ends: 14489 [2019-12-27 20:33:12,787 INFO L226 Difference]: Without dead ends: 14489 [2019-12-27 20:33:12,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:33:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14489 states. [2019-12-27 20:33:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14489 to 13735. [2019-12-27 20:33:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13735 states. [2019-12-27 20:33:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13735 states to 13735 states and 44326 transitions. [2019-12-27 20:33:13,044 INFO L78 Accepts]: Start accepts. Automaton has 13735 states and 44326 transitions. Word has length 64 [2019-12-27 20:33:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:13,044 INFO L462 AbstractCegarLoop]: Abstraction has 13735 states and 44326 transitions. [2019-12-27 20:33:13,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:33:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13735 states and 44326 transitions. [2019-12-27 20:33:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:13,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:13,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:13,061 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2140683233, now seen corresponding path program 5 times [2019-12-27 20:33:13,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:13,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975685837] [2019-12-27 20:33:13,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:13,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975685837] [2019-12-27 20:33:13,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:13,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:33:13,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [386947076] [2019-12-27 20:33:13,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:13,177 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:13,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 484 transitions. [2019-12-27 20:33:13,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:13,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:13,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 20:33:13,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:33:13,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:13,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:33:13,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:33:13,671 INFO L87 Difference]: Start difference. First operand 13735 states and 44326 transitions. Second operand 10 states. [2019-12-27 20:33:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:15,653 INFO L93 Difference]: Finished difference Result 28310 states and 87871 transitions. [2019-12-27 20:33:15,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:33:15,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 20:33:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:15,697 INFO L225 Difference]: With dead ends: 28310 [2019-12-27 20:33:15,697 INFO L226 Difference]: Without dead ends: 28142 [2019-12-27 20:33:15,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:33:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28142 states. [2019-12-27 20:33:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28142 to 21097. [2019-12-27 20:33:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21097 states. [2019-12-27 20:33:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21097 states to 21097 states and 65944 transitions. [2019-12-27 20:33:16,214 INFO L78 Accepts]: Start accepts. Automaton has 21097 states and 65944 transitions. Word has length 64 [2019-12-27 20:33:16,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:16,215 INFO L462 AbstractCegarLoop]: Abstraction has 21097 states and 65944 transitions. [2019-12-27 20:33:16,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:33:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 21097 states and 65944 transitions. [2019-12-27 20:33:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:16,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:16,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:16,240 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:16,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1450189681, now seen corresponding path program 6 times [2019-12-27 20:33:16,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:16,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322252170] [2019-12-27 20:33:16,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:16,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322252170] [2019-12-27 20:33:16,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:16,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:33:16,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [860161820] [2019-12-27 20:33:16,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:16,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:16,548 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 354 transitions. [2019-12-27 20:33:16,548 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:16,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:33:16,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:33:16,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:16,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:33:16,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:33:16,797 INFO L87 Difference]: Start difference. First operand 21097 states and 65944 transitions. Second operand 14 states. [2019-12-27 20:33:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:20,088 INFO L93 Difference]: Finished difference Result 63916 states and 196154 transitions. [2019-12-27 20:33:20,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:33:20,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2019-12-27 20:33:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:20,186 INFO L225 Difference]: With dead ends: 63916 [2019-12-27 20:33:20,186 INFO L226 Difference]: Without dead ends: 63696 [2019-12-27 20:33:20,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-12-27 20:33:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63696 states. [2019-12-27 20:33:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63696 to 27394. [2019-12-27 20:33:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27394 states. [2019-12-27 20:33:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27394 states to 27394 states and 84917 transitions. [2019-12-27 20:33:21,143 INFO L78 Accepts]: Start accepts. Automaton has 27394 states and 84917 transitions. Word has length 64 [2019-12-27 20:33:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:21,143 INFO L462 AbstractCegarLoop]: Abstraction has 27394 states and 84917 transitions. [2019-12-27 20:33:21,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:33:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 27394 states and 84917 transitions. [2019-12-27 20:33:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:21,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:21,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:21,172 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:21,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash -111496539, now seen corresponding path program 7 times [2019-12-27 20:33:21,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:21,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176892556] [2019-12-27 20:33:21,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:21,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176892556] [2019-12-27 20:33:21,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:21,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:33:21,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376628279] [2019-12-27 20:33:21,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:21,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:21,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 446 transitions. [2019-12-27 20:33:21,479 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:21,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:21,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:33:21,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:33:21,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:21,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:33:21,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:33:21,590 INFO L87 Difference]: Start difference. First operand 27394 states and 84917 transitions. Second operand 9 states. [2019-12-27 20:33:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:23,079 INFO L93 Difference]: Finished difference Result 37190 states and 113890 transitions. [2019-12-27 20:33:23,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:33:23,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 20:33:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:23,137 INFO L225 Difference]: With dead ends: 37190 [2019-12-27 20:33:23,137 INFO L226 Difference]: Without dead ends: 37190 [2019-12-27 20:33:23,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:33:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37190 states. [2019-12-27 20:33:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37190 to 29302. [2019-12-27 20:33:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29302 states. [2019-12-27 20:33:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29302 states to 29302 states and 90371 transitions. [2019-12-27 20:33:23,875 INFO L78 Accepts]: Start accepts. Automaton has 29302 states and 90371 transitions. Word has length 64 [2019-12-27 20:33:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:23,876 INFO L462 AbstractCegarLoop]: Abstraction has 29302 states and 90371 transitions. [2019-12-27 20:33:23,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:33:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 29302 states and 90371 transitions. [2019-12-27 20:33:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:23,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:23,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:23,913 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:23,913 INFO L82 PathProgramCache]: Analyzing trace with hash 15341739, now seen corresponding path program 8 times [2019-12-27 20:33:23,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:23,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937596566] [2019-12-27 20:33:23,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:24,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937596566] [2019-12-27 20:33:24,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:24,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:33:24,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497831619] [2019-12-27 20:33:24,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:24,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:24,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 429 transitions. [2019-12-27 20:33:24,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:24,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 20:33:24,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:33:24,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:24,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:33:24,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:33:24,625 INFO L87 Difference]: Start difference. First operand 29302 states and 90371 transitions. Second operand 13 states. [2019-12-27 20:33:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:27,400 INFO L93 Difference]: Finished difference Result 66974 states and 205027 transitions. [2019-12-27 20:33:27,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:33:27,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 20:33:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:27,520 INFO L225 Difference]: With dead ends: 66974 [2019-12-27 20:33:27,520 INFO L226 Difference]: Without dead ends: 66974 [2019-12-27 20:33:27,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:33:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66974 states. [2019-12-27 20:33:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66974 to 30002. [2019-12-27 20:33:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30002 states. [2019-12-27 20:33:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30002 states to 30002 states and 92490 transitions. [2019-12-27 20:33:28,667 INFO L78 Accepts]: Start accepts. Automaton has 30002 states and 92490 transitions. Word has length 64 [2019-12-27 20:33:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:28,667 INFO L462 AbstractCegarLoop]: Abstraction has 30002 states and 92490 transitions. [2019-12-27 20:33:28,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:33:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 30002 states and 92490 transitions. [2019-12-27 20:33:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:28,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:28,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:28,704 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash -869972359, now seen corresponding path program 9 times [2019-12-27 20:33:28,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:28,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757826238] [2019-12-27 20:33:28,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:28,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757826238] [2019-12-27 20:33:28,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:28,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:33:28,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [774042259] [2019-12-27 20:33:28,790 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:28,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:28,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 356 transitions. [2019-12-27 20:33:28,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:29,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:29,129 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:33:29,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:33:29,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:29,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:33:29,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:33:29,131 INFO L87 Difference]: Start difference. First operand 30002 states and 92490 transitions. Second operand 11 states. [2019-12-27 20:33:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:31,458 INFO L93 Difference]: Finished difference Result 86101 states and 262425 transitions. [2019-12-27 20:33:31,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:33:31,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 20:33:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:31,604 INFO L225 Difference]: With dead ends: 86101 [2019-12-27 20:33:31,605 INFO L226 Difference]: Without dead ends: 86101 [2019-12-27 20:33:31,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:33:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86101 states. [2019-12-27 20:33:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86101 to 34228. [2019-12-27 20:33:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34228 states. [2019-12-27 20:33:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34228 states to 34228 states and 105455 transitions. [2019-12-27 20:33:32,893 INFO L78 Accepts]: Start accepts. Automaton has 34228 states and 105455 transitions. Word has length 64 [2019-12-27 20:33:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:32,894 INFO L462 AbstractCegarLoop]: Abstraction has 34228 states and 105455 transitions. [2019-12-27 20:33:32,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:33:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34228 states and 105455 transitions. [2019-12-27 20:33:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:32,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:32,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:32,939 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:32,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1223539079, now seen corresponding path program 10 times [2019-12-27 20:33:32,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:32,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494868862] [2019-12-27 20:33:32,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:33,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494868862] [2019-12-27 20:33:33,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:33,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:33:33,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365795265] [2019-12-27 20:33:33,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:33,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:33,300 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 404 transitions. [2019-12-27 20:33:33,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:33,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:33,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:33:33,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:33:33,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:33:33,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:33:33,496 INFO L87 Difference]: Start difference. First operand 34228 states and 105455 transitions. Second operand 12 states. [2019-12-27 20:33:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:36,406 INFO L93 Difference]: Finished difference Result 86251 states and 262740 transitions. [2019-12-27 20:33:36,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:33:36,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 20:33:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:36,879 INFO L225 Difference]: With dead ends: 86251 [2019-12-27 20:33:36,879 INFO L226 Difference]: Without dead ends: 86251 [2019-12-27 20:33:36,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-12-27 20:33:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86251 states. [2019-12-27 20:33:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86251 to 32445. [2019-12-27 20:33:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32445 states. [2019-12-27 20:33:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32445 states to 32445 states and 100081 transitions. [2019-12-27 20:33:37,774 INFO L78 Accepts]: Start accepts. Automaton has 32445 states and 100081 transitions. Word has length 64 [2019-12-27 20:33:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:37,774 INFO L462 AbstractCegarLoop]: Abstraction has 32445 states and 100081 transitions. [2019-12-27 20:33:37,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:33:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 32445 states and 100081 transitions. [2019-12-27 20:33:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:33:37,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:37,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:37,811 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash 935122135, now seen corresponding path program 11 times [2019-12-27 20:33:37,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:37,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678397012] [2019-12-27 20:33:37,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:37,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678397012] [2019-12-27 20:33:37,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:37,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:33:37,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [70839394] [2019-12-27 20:33:37,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:37,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:38,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 349 transitions. [2019-12-27 20:33:38,115 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:38,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:33:38,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:33:38,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:38,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:33:38,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:33:38,117 INFO L87 Difference]: Start difference. First operand 32445 states and 100081 transitions. Second operand 3 states. [2019-12-27 20:33:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:38,224 INFO L93 Difference]: Finished difference Result 32445 states and 100080 transitions. [2019-12-27 20:33:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:33:38,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 20:33:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:38,276 INFO L225 Difference]: With dead ends: 32445 [2019-12-27 20:33:38,277 INFO L226 Difference]: Without dead ends: 32445 [2019-12-27 20:33:38,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:33:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32445 states. [2019-12-27 20:33:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32445 to 28133. [2019-12-27 20:33:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28133 states. [2019-12-27 20:33:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28133 states to 28133 states and 87733 transitions. [2019-12-27 20:33:39,119 INFO L78 Accepts]: Start accepts. Automaton has 28133 states and 87733 transitions. Word has length 64 [2019-12-27 20:33:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:39,119 INFO L462 AbstractCegarLoop]: Abstraction has 28133 states and 87733 transitions. [2019-12-27 20:33:39,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:33:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28133 states and 87733 transitions. [2019-12-27 20:33:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:33:39,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:39,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:39,153 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash -762862254, now seen corresponding path program 1 times [2019-12-27 20:33:39,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:39,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784974020] [2019-12-27 20:33:39,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:39,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784974020] [2019-12-27 20:33:39,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:39,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:33:39,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1908208311] [2019-12-27 20:33:39,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:39,239 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:39,469 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 442 transitions. [2019-12-27 20:33:39,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:39,504 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:33:39,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:33:39,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:39,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:33:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:33:39,506 INFO L87 Difference]: Start difference. First operand 28133 states and 87733 transitions. Second operand 6 states. [2019-12-27 20:33:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:39,887 INFO L93 Difference]: Finished difference Result 26476 states and 81076 transitions. [2019-12-27 20:33:39,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:33:39,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 20:33:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:39,927 INFO L225 Difference]: With dead ends: 26476 [2019-12-27 20:33:39,927 INFO L226 Difference]: Without dead ends: 26476 [2019-12-27 20:33:39,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:33:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-27 20:33:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 19144. [2019-12-27 20:33:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19144 states. [2019-12-27 20:33:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19144 states to 19144 states and 59040 transitions. [2019-12-27 20:33:40,291 INFO L78 Accepts]: Start accepts. Automaton has 19144 states and 59040 transitions. Word has length 65 [2019-12-27 20:33:40,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:40,291 INFO L462 AbstractCegarLoop]: Abstraction has 19144 states and 59040 transitions. [2019-12-27 20:33:40,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:33:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 19144 states and 59040 transitions. [2019-12-27 20:33:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:33:40,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:40,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:40,313 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:40,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 297142072, now seen corresponding path program 1 times [2019-12-27 20:33:40,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:40,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748345849] [2019-12-27 20:33:40,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:40,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748345849] [2019-12-27 20:33:40,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:40,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:33:40,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [328219568] [2019-12-27 20:33:40,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:40,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:40,623 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 472 transitions. [2019-12-27 20:33:40,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:40,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:40,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:40,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:41,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:33:41,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:33:41,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:41,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:33:41,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:33:41,038 INFO L87 Difference]: Start difference. First operand 19144 states and 59040 transitions. Second operand 15 states. [2019-12-27 20:33:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:42,950 INFO L93 Difference]: Finished difference Result 30992 states and 94132 transitions. [2019-12-27 20:33:42,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:33:42,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 20:33:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:42,983 INFO L225 Difference]: With dead ends: 30992 [2019-12-27 20:33:42,983 INFO L226 Difference]: Without dead ends: 22897 [2019-12-27 20:33:42,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:33:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22897 states. [2019-12-27 20:33:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22897 to 19767. [2019-12-27 20:33:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19767 states. [2019-12-27 20:33:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19767 states to 19767 states and 60487 transitions. [2019-12-27 20:33:43,321 INFO L78 Accepts]: Start accepts. Automaton has 19767 states and 60487 transitions. Word has length 66 [2019-12-27 20:33:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:43,321 INFO L462 AbstractCegarLoop]: Abstraction has 19767 states and 60487 transitions. [2019-12-27 20:33:43,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:33:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 19767 states and 60487 transitions. [2019-12-27 20:33:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:33:43,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:43,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:43,347 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1430362900, now seen corresponding path program 2 times [2019-12-27 20:33:43,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:43,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886793518] [2019-12-27 20:33:43,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:43,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886793518] [2019-12-27 20:33:43,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:43,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:33:43,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1501711190] [2019-12-27 20:33:43,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:43,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:43,770 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 264 states and 508 transitions. [2019-12-27 20:33:43,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:43,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:44,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:44,265 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:33:44,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:33:44,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:44,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:33:44,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:33:44,267 INFO L87 Difference]: Start difference. First operand 19767 states and 60487 transitions. Second operand 16 states. [2019-12-27 20:33:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:46,218 INFO L93 Difference]: Finished difference Result 30264 states and 91301 transitions. [2019-12-27 20:33:46,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:33:46,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 20:33:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:46,250 INFO L225 Difference]: With dead ends: 30264 [2019-12-27 20:33:46,250 INFO L226 Difference]: Without dead ends: 22753 [2019-12-27 20:33:46,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:33:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22753 states. [2019-12-27 20:33:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22753 to 19719. [2019-12-27 20:33:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19719 states. [2019-12-27 20:33:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19719 states to 19719 states and 60327 transitions. [2019-12-27 20:33:46,581 INFO L78 Accepts]: Start accepts. Automaton has 19719 states and 60327 transitions. Word has length 66 [2019-12-27 20:33:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:46,582 INFO L462 AbstractCegarLoop]: Abstraction has 19719 states and 60327 transitions. [2019-12-27 20:33:46,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:33:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 19719 states and 60327 transitions. [2019-12-27 20:33:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:33:46,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:46,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:46,604 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash 621049950, now seen corresponding path program 3 times [2019-12-27 20:33:46,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:46,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236781385] [2019-12-27 20:33:46,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:46,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236781385] [2019-12-27 20:33:46,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:46,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:33:46,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617506781] [2019-12-27 20:33:46,753 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:46,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:47,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 414 transitions. [2019-12-27 20:33:47,159 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:47,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:47,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:47,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 20:33:47,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:33:47,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:47,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:33:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:33:47,834 INFO L87 Difference]: Start difference. First operand 19719 states and 60327 transitions. Second operand 20 states. [2019-12-27 20:33:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:50,910 INFO L93 Difference]: Finished difference Result 41260 states and 123491 transitions. [2019-12-27 20:33:50,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:33:50,910 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 20:33:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:50,969 INFO L225 Difference]: With dead ends: 41260 [2019-12-27 20:33:50,970 INFO L226 Difference]: Without dead ends: 41020 [2019-12-27 20:33:50,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:33:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41020 states. [2019-12-27 20:33:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41020 to 21825. [2019-12-27 20:33:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21825 states. [2019-12-27 20:33:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21825 states to 21825 states and 66562 transitions. [2019-12-27 20:33:51,450 INFO L78 Accepts]: Start accepts. Automaton has 21825 states and 66562 transitions. Word has length 66 [2019-12-27 20:33:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:51,450 INFO L462 AbstractCegarLoop]: Abstraction has 21825 states and 66562 transitions. [2019-12-27 20:33:51,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:33:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 21825 states and 66562 transitions. [2019-12-27 20:33:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:33:51,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:51,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:51,472 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:51,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:51,472 INFO L82 PathProgramCache]: Analyzing trace with hash -507652668, now seen corresponding path program 4 times [2019-12-27 20:33:51,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:51,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477741367] [2019-12-27 20:33:51,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:51,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477741367] [2019-12-27 20:33:51,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:51,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:33:51,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336646346] [2019-12-27 20:33:51,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:51,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:52,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 296 states and 570 transitions. [2019-12-27 20:33:52,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:52,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:52,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:52,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:52,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:52,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 20:33:52,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 20:33:52,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:52,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 20:33:52,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:33:52,925 INFO L87 Difference]: Start difference. First operand 21825 states and 66562 transitions. Second operand 22 states. [2019-12-27 20:33:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:57,436 INFO L93 Difference]: Finished difference Result 37841 states and 113964 transitions. [2019-12-27 20:33:57,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 20:33:57,437 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 20:33:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:57,482 INFO L225 Difference]: With dead ends: 37841 [2019-12-27 20:33:57,482 INFO L226 Difference]: Without dead ends: 27565 [2019-12-27 20:33:57,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 20:33:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27565 states. [2019-12-27 20:33:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27565 to 21299. [2019-12-27 20:33:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21299 states. [2019-12-27 20:33:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21299 states to 21299 states and 64628 transitions. [2019-12-27 20:33:57,887 INFO L78 Accepts]: Start accepts. Automaton has 21299 states and 64628 transitions. Word has length 66 [2019-12-27 20:33:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:57,887 INFO L462 AbstractCegarLoop]: Abstraction has 21299 states and 64628 transitions. [2019-12-27 20:33:57,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 20:33:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21299 states and 64628 transitions. [2019-12-27 20:33:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:33:57,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:57,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:57,908 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:57,909 INFO L82 PathProgramCache]: Analyzing trace with hash -993001140, now seen corresponding path program 5 times [2019-12-27 20:33:57,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:57,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882792777] [2019-12-27 20:33:57,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:58,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882792777] [2019-12-27 20:33:58,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:58,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:33:58,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341766921] [2019-12-27 20:33:58,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:58,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:58,434 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 304 states and 608 transitions. [2019-12-27 20:33:58,434 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:58,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:58,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:58,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:33:59,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 20:33:59,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 20:33:59,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:59,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 20:33:59,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:33:59,270 INFO L87 Difference]: Start difference. First operand 21299 states and 64628 transitions. Second operand 22 states. [2019-12-27 20:34:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:34:03,004 INFO L93 Difference]: Finished difference Result 24751 states and 73877 transitions. [2019-12-27 20:34:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:34:03,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 20:34:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:34:03,039 INFO L225 Difference]: With dead ends: 24751 [2019-12-27 20:34:03,039 INFO L226 Difference]: Without dead ends: 24216 [2019-12-27 20:34:03,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 12 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:34:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24216 states. [2019-12-27 20:34:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24216 to 20923. [2019-12-27 20:34:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20923 states. [2019-12-27 20:34:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20923 states to 20923 states and 63650 transitions. [2019-12-27 20:34:03,414 INFO L78 Accepts]: Start accepts. Automaton has 20923 states and 63650 transitions. Word has length 66 [2019-12-27 20:34:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:34:03,414 INFO L462 AbstractCegarLoop]: Abstraction has 20923 states and 63650 transitions. [2019-12-27 20:34:03,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 20:34:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 20923 states and 63650 transitions. [2019-12-27 20:34:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:34:03,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:34:03,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:34:03,438 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:34:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:34:03,438 INFO L82 PathProgramCache]: Analyzing trace with hash 398135010, now seen corresponding path program 6 times [2019-12-27 20:34:03,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:34:03,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729313197] [2019-12-27 20:34:03,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:34:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:34:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:34:03,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729313197] [2019-12-27 20:34:03,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:34:03,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:34:03,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1632329034] [2019-12-27 20:34:03,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:34:03,553 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:34:03,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 374 transitions. [2019-12-27 20:34:03,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:34:03,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:34:03,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:34:03,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:34:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:34:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:34:03,819 INFO L87 Difference]: Start difference. First operand 20923 states and 63650 transitions. Second operand 4 states. [2019-12-27 20:34:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:34:03,997 INFO L93 Difference]: Finished difference Result 24904 states and 75905 transitions. [2019-12-27 20:34:03,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:34:03,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 20:34:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:34:04,048 INFO L225 Difference]: With dead ends: 24904 [2019-12-27 20:34:04,054 INFO L226 Difference]: Without dead ends: 24904 [2019-12-27 20:34:04,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:34:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24904 states. [2019-12-27 20:34:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24904 to 21853. [2019-12-27 20:34:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21853 states. [2019-12-27 20:34:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21853 states to 21853 states and 67072 transitions. [2019-12-27 20:34:04,743 INFO L78 Accepts]: Start accepts. Automaton has 21853 states and 67072 transitions. Word has length 66 [2019-12-27 20:34:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:34:04,744 INFO L462 AbstractCegarLoop]: Abstraction has 21853 states and 67072 transitions. [2019-12-27 20:34:04,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:34:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 21853 states and 67072 transitions. [2019-12-27 20:34:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:34:04,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:34:04,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:34:04,789 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:34:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:34:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1158921090, now seen corresponding path program 1 times [2019-12-27 20:34:04,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:34:04,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198870032] [2019-12-27 20:34:04,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:34:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:34:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:34:05,038 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:34:05,039 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:34:05,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= v_~z~0_13 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~a$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t639~0.offset_16| 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x~0_9) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t639~0.base_19| 4)) (= 0 v_~weak$$choice2~0_32) (= 0 v_~a$r_buff1_thd1~0_15) (= v_~a~0_28 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t639~0.base_19| 1) |v_#valid_57|) (= 0 v_~a$w_buff1_used~0_73) (= v_~a$flush_delayed~0_13 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t639~0.base_19|) (= 0 v_~a$w_buff0_used~0_112) (= 0 v_~__unbuffered_p2_EAX~0_11) (= v_~a$r_buff0_thd2~0_20 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_13 0) (= 0 v_~weak$$choice0~0_7) (= v_~a$mem_tmp~0_10 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t639~0.base_19|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t639~0.base_19| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t639~0.base_19|) |v_ULTIMATE.start_main_~#t639~0.offset_16| 0)) |v_#memory_int_19|) (= v_~__unbuffered_p0_EBX~0_12 0) (= 0 v_~a$r_buff1_thd0~0_19) (= v_~a$r_buff0_thd3~0_75 0) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~a$w_buff0~0_26) (= v_~y~0_10 0) (= v_~a$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~a$w_buff1~0_25))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_28, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ULTIMATE.start_main_~#t640~0.offset=|v_ULTIMATE.start_main_~#t640~0.offset_16|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ULTIMATE.start_main_~#t640~0.base=|v_ULTIMATE.start_main_~#t640~0.base_21|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ULTIMATE.start_main_~#t641~0.base=|v_ULTIMATE.start_main_~#t641~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_9, ULTIMATE.start_main_~#t639~0.base=|v_ULTIMATE.start_main_~#t639~0.base_19|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_~#t639~0.offset=|v_ULTIMATE.start_main_~#t639~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ULTIMATE.start_main_~#t641~0.offset=|v_ULTIMATE.start_main_~#t641~0.offset_17|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t640~0.offset, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t640~0.base, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t641~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t639~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t639~0.offset, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t641~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 20:34:05,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t640~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t640~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t640~0.base_10|) |v_ULTIMATE.start_main_~#t640~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t640~0.base_10| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t640~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t640~0.offset_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t640~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t640~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t640~0.offset=|v_ULTIMATE.start_main_~#t640~0.offset_9|, ULTIMATE.start_main_~#t640~0.base=|v_ULTIMATE.start_main_~#t640~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t640~0.offset, ULTIMATE.start_main_~#t640~0.base, #length] because there is no mapped edge [2019-12-27 20:34:05,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t641~0.base_13|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t641~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t641~0.base_13|) (= |v_ULTIMATE.start_main_~#t641~0.offset_11| 0) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t641~0.base_13|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t641~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t641~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t641~0.base_13|) |v_ULTIMATE.start_main_~#t641~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t641~0.base=|v_ULTIMATE.start_main_~#t641~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t641~0.offset=|v_ULTIMATE.start_main_~#t641~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t641~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t641~0.offset, #length] because there is no mapped edge [2019-12-27 20:34:05,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 1 v_~a$w_buff0~0_16) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8) (= v_~a$w_buff0~0_17 v_~a$w_buff1~0_17) (= v_~a$w_buff0_used~0_89 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= v_~a$w_buff0_used~0_90 v_~a$w_buff1_used~0_60) (= 0 (mod v_~a$w_buff1_used~0_60 256))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_17, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_16, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_89, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_60, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:34:05,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-884995555 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-884995555 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In-884995555 |P1Thread1of1ForFork2_#t~ite9_Out-884995555|)) (and (= ~a$w_buff1~0_In-884995555 |P1Thread1of1ForFork2_#t~ite9_Out-884995555|) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In-884995555, ~a$w_buff1~0=~a$w_buff1~0_In-884995555, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-884995555, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-884995555} OutVars{~a~0=~a~0_In-884995555, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-884995555|, ~a$w_buff1~0=~a$w_buff1~0_In-884995555, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-884995555, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-884995555} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 20:34:05,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In816270096 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In816270096 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out816270096| ~a$w_buff0_used~0_In816270096)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out816270096|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In816270096, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In816270096} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out816270096|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In816270096, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In816270096} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:34:05,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1683622436 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1683622436 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1683622436 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1683622436 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1683622436| 0)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1683622436| ~a$w_buff1_used~0_In-1683622436) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1683622436, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683622436, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1683622436, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1683622436} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1683622436|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1683622436, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683622436, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1683622436, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1683622436} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:34:05,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In171258570 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In171258570 256) 0))) (or (and (= 0 ~a$r_buff0_thd1~0_Out171258570) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_In171258570 ~a$r_buff0_thd1~0_Out171258570) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In171258570, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In171258570} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out171258570|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In171258570, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out171258570} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:34:05,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In2116894756 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In2116894756 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In2116894756 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In2116894756 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out2116894756| ~a$r_buff1_thd1~0_In2116894756) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out2116894756| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2116894756, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2116894756, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2116894756, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2116894756} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out2116894756|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2116894756, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2116894756, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2116894756, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2116894756} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:34:05,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L760-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:34:05,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= v_~a~0_20 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_20, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:34:05,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1491025234 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1491025234 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1491025234|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1491025234| ~a$w_buff0_used~0_In1491025234)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1491025234, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1491025234} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1491025234, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1491025234, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1491025234|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:34:05,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1465834923 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1465834923 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1465834923 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1465834923 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1465834923| ~a$w_buff1_used~0_In-1465834923)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1465834923| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1465834923, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1465834923, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1465834923, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1465834923} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1465834923, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1465834923, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1465834923, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1465834923|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1465834923} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:34:05,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1962226583 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1962226583 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1962226583| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1962226583| ~a$r_buff0_thd2~0_In-1962226583)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1962226583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1962226583} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1962226583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1962226583, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1962226583|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:34:05,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1437729152 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1437729152 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1437729152 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1437729152 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1437729152| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out-1437729152| ~a$r_buff1_thd2~0_In-1437729152) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1437729152, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1437729152, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1437729152, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1437729152} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1437729152, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1437729152, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1437729152, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1437729152, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1437729152|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:34:05,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L780-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:34:05,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In187955541 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In187955541| |P2Thread1of1ForFork0_#t~ite20_Out187955541|) (= |P2Thread1of1ForFork0_#t~ite21_Out187955541| ~a$w_buff0~0_In187955541) (not .cse0)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In187955541 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In187955541 256)) .cse1) (= (mod ~a$w_buff0_used~0_In187955541 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In187955541 256)) .cse1))) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out187955541| |P2Thread1of1ForFork0_#t~ite20_Out187955541|) (= |P2Thread1of1ForFork0_#t~ite20_Out187955541| ~a$w_buff0~0_In187955541)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In187955541, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In187955541, ~a$w_buff0_used~0=~a$w_buff0_used~0_In187955541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In187955541, ~a$w_buff1_used~0=~a$w_buff1_used~0_In187955541, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In187955541|, ~weak$$choice2~0=~weak$$choice2~0_In187955541} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out187955541|, ~a$w_buff0~0=~a$w_buff0~0_In187955541, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In187955541, ~a$w_buff0_used~0=~a$w_buff0_used~0_In187955541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In187955541, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out187955541|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In187955541, ~weak$$choice2~0=~weak$$choice2~0_In187955541} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 20:34:05,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1345398142 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1345398142| |P2Thread1of1ForFork0_#t~ite26_Out-1345398142|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1345398142 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-1345398142 256)) .cse0) (and .cse0 (= (mod ~a$w_buff1_used~0_In-1345398142 256) 0)) (= (mod ~a$w_buff0_used~0_In-1345398142 256) 0))) .cse1 (= ~a$w_buff0_used~0_In-1345398142 |P2Thread1of1ForFork0_#t~ite26_Out-1345398142|)) (and (= ~a$w_buff0_used~0_In-1345398142 |P2Thread1of1ForFork0_#t~ite27_Out-1345398142|) (= |P2Thread1of1ForFork0_#t~ite26_In-1345398142| |P2Thread1of1ForFork0_#t~ite26_Out-1345398142|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1345398142|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1345398142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345398142, ~weak$$choice2~0=~weak$$choice2~0_In-1345398142} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1345398142|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1345398142|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1345398142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345398142, ~weak$$choice2~0=~weak$$choice2~0_In-1345398142} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 20:34:05,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-825834920 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In-825834920| |P2Thread1of1ForFork0_#t~ite29_Out-825834920|) (not .cse0) (= ~a$w_buff1_used~0_In-825834920 |P2Thread1of1ForFork0_#t~ite30_Out-825834920|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-825834920| |P2Thread1of1ForFork0_#t~ite30_Out-825834920|) (= |P2Thread1of1ForFork0_#t~ite29_Out-825834920| ~a$w_buff1_used~0_In-825834920) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-825834920 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-825834920 256))) (and (= (mod ~a$w_buff1_used~0_In-825834920 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-825834920 256))))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-825834920, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-825834920, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-825834920, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-825834920, ~weak$$choice2~0=~weak$$choice2~0_In-825834920, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-825834920|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-825834920, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-825834920, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-825834920, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-825834920|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-825834920, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-825834920|, ~weak$$choice2~0=~weak$$choice2~0_In-825834920} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:34:05,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff0_thd3~0_47)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:34:05,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0) (= v_~a~0_21 v_~a$mem_tmp~0_4)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_21, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 20:34:05,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out2144601133| |P2Thread1of1ForFork0_#t~ite38_Out2144601133|)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In2144601133 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In2144601133 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~a$w_buff1~0_In2144601133 |P2Thread1of1ForFork0_#t~ite38_Out2144601133|)) (and .cse1 (= ~a~0_In2144601133 |P2Thread1of1ForFork0_#t~ite38_Out2144601133|) (or .cse2 .cse0)))) InVars {~a~0=~a~0_In2144601133, ~a$w_buff1~0=~a$w_buff1~0_In2144601133, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2144601133, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2144601133} OutVars{~a~0=~a~0_In2144601133, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out2144601133|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2144601133|, ~a$w_buff1~0=~a$w_buff1~0_In2144601133, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2144601133, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2144601133} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:34:05,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In2117596950 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In2117596950 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In2117596950 |P2Thread1of1ForFork0_#t~ite40_Out2117596950|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out2117596950| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2117596950, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2117596950} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2117596950|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2117596950, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2117596950} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:34:05,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In892648928 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In892648928 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In892648928 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In892648928 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In892648928 |P2Thread1of1ForFork0_#t~ite41_Out892648928|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out892648928|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In892648928, ~a$w_buff0_used~0=~a$w_buff0_used~0_In892648928, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In892648928, ~a$w_buff1_used~0=~a$w_buff1_used~0_In892648928} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In892648928, ~a$w_buff0_used~0=~a$w_buff0_used~0_In892648928, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In892648928, ~a$w_buff1_used~0=~a$w_buff1_used~0_In892648928, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out892648928|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:34:05,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1795510086 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1795510086 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1795510086|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1795510086| ~a$r_buff0_thd3~0_In-1795510086)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1795510086, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1795510086} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1795510086, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1795510086, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1795510086|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:34:05,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-2100899211 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-2100899211 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2100899211 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-2100899211 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-2100899211|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-2100899211 |P2Thread1of1ForFork0_#t~ite43_Out-2100899211|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2100899211, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2100899211, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2100899211, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2100899211} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2100899211|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2100899211, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2100899211, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2100899211, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2100899211} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:34:05,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:34:05,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:34:05,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out2025689887| |ULTIMATE.start_main_#t~ite48_Out2025689887|)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2025689887 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In2025689887 256)))) (or (and .cse0 (not .cse1) (= ~a$w_buff1~0_In2025689887 |ULTIMATE.start_main_#t~ite47_Out2025689887|) (not .cse2)) (and .cse0 (= ~a~0_In2025689887 |ULTIMATE.start_main_#t~ite47_Out2025689887|) (or .cse2 .cse1)))) InVars {~a~0=~a~0_In2025689887, ~a$w_buff1~0=~a$w_buff1~0_In2025689887, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2025689887, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2025689887} OutVars{~a~0=~a~0_In2025689887, ~a$w_buff1~0=~a$w_buff1~0_In2025689887, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2025689887|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2025689887, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2025689887|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2025689887} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 20:34:05,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In683853147 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In683853147 256)))) (or (and (= ~a$w_buff0_used~0_In683853147 |ULTIMATE.start_main_#t~ite49_Out683853147|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out683853147|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In683853147, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In683853147} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In683853147, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out683853147|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In683853147} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:34:05,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1801076346 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1801076346 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1801076346 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd0~0_In1801076346 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1801076346 |ULTIMATE.start_main_#t~ite50_Out1801076346|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1801076346|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1801076346, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1801076346, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1801076346, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1801076346} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1801076346|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1801076346, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1801076346, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1801076346, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1801076346} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:34:05,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1690562821 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1690562821 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In-1690562821 |ULTIMATE.start_main_#t~ite51_Out-1690562821|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1690562821|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1690562821, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1690562821} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1690562821|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1690562821, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1690562821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:34:05,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-1655904143 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1655904143 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1655904143 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1655904143 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1655904143|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd0~0_In-1655904143 |ULTIMATE.start_main_#t~ite52_Out-1655904143|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1655904143, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1655904143, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1655904143, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1655904143} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1655904143|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1655904143, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1655904143, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1655904143, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1655904143} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:34:05,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~z~0_9) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~__unbuffered_p0_EAX~0_9 1) (= v_~__unbuffered_p2_EAX~0_8 2) (= |v_ULTIMATE.start_main_#t~ite52_11| v_~a$r_buff1_thd0~0_15) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:34:05,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:34:05 BasicIcfg [2019-12-27 20:34:05,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:34:05,182 INFO L168 Benchmark]: Toolchain (without parser) took 140775.01 ms. Allocated memory was 144.7 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 100.7 MB in the beginning and 989.2 MB in the end (delta: -888.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 20:34:05,182 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:34:05,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.16 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 153.5 MB in the end (delta: -53.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:34:05,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.66 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:34:05,184 INFO L168 Benchmark]: Boogie Preprocessor took 39.69 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:34:05,184 INFO L168 Benchmark]: RCFGBuilder took 1028.24 ms. Allocated memory is still 202.4 MB. Free memory was 148.7 MB in the beginning and 97.6 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:34:05,185 INFO L168 Benchmark]: TraceAbstraction took 138829.43 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 96.9 MB in the beginning and 989.2 MB in the end (delta: -892.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 20:34:05,187 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.27 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.16 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 153.5 MB in the end (delta: -53.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.66 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.69 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1028.24 ms. Allocated memory is still 202.4 MB. Free memory was 148.7 MB in the beginning and 97.6 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 138829.43 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 96.9 MB in the beginning and 989.2 MB in the end (delta: -892.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 6719 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82648 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t641, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 138.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 53.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7142 SDtfs, 14112 SDslu, 31772 SDs, 0 SdLazy, 25054 SolverSat, 843 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 827 GetRequests, 273 SyntacticMatches, 106 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3241 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170989occurred 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: 42.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 357822 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1444 ConstructedInterpolants, 0 QuantifiedInterpolants, 298253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...