/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/podwr001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:46:26,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:46:26,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:46:26,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:46:26,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:46:26,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:46:26,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:46:26,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:46:26,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:46:26,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:46:26,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:46:26,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:46:26,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:46:26,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:46:26,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:46:26,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:46:26,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:46:26,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:46:26,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:46:26,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:46:26,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:46:26,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:46:26,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:46:26,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:46:26,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:46:26,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:46:26,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:46:26,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:46:26,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:46:26,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:46:26,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:46:26,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:46:26,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:46:26,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:46:26,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:46:26,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:46:26,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:46:26,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:46:26,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:46:26,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:46:26,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:46:26,354 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 21:46:26,374 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:46:26,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:46:26,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:46:26,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:46:26,378 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:46:26,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:46:26,378 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:46:26,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:46:26,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:46:26,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:46:26,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:46:26,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:46:26,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:46:26,381 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:46:26,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:46:26,381 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:46:26,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:46:26,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:46:26,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:46:26,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:46:26,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:46:26,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:46:26,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:46:26,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:46:26,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:46:26,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:46:26,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:46:26,384 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:46:26,384 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:46:26,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:46:26,386 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:46:26,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:46:26,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:46:26,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:46:26,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:46:26,694 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:46:26,694 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:46:26,695 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i [2019-12-27 21:46:26,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de5257c6/5c28d9f42d3140e8a667cd0fbb210614/FLAGd33f8558b [2019-12-27 21:46:27,345 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:46:27,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i [2019-12-27 21:46:27,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de5257c6/5c28d9f42d3140e8a667cd0fbb210614/FLAGd33f8558b [2019-12-27 21:46:27,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de5257c6/5c28d9f42d3140e8a667cd0fbb210614 [2019-12-27 21:46:27,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:46:27,663 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:46:27,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:46:27,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:46:27,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:46:27,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:46:27" (1/1) ... [2019-12-27 21:46:27,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10660ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:27, skipping insertion in model container [2019-12-27 21:46:27,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:46:27" (1/1) ... [2019-12-27 21:46:27,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:46:27,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:46:28,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:46:28,349 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:46:28,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:46:28,495 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:46:28,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28 WrapperNode [2019-12-27 21:46:28,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:46:28,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:46:28,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:46:28,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:46:28,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (1/1) ... [2019-12-27 21:46:28,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (1/1) ... [2019-12-27 21:46:28,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:46:28,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:46:28,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:46:28,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:46:28,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (1/1) ... [2019-12-27 21:46:28,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (1/1) ... [2019-12-27 21:46:28,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (1/1) ... [2019-12-27 21:46:28,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (1/1) ... [2019-12-27 21:46:28,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (1/1) ... [2019-12-27 21:46:28,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (1/1) ... [2019-12-27 21:46:28,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (1/1) ... [2019-12-27 21:46:28,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:46:28,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:46:28,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:46:28,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:46:28,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (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 21:46:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:46:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:46:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:46:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:46:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:46:28,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:46:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:46:28,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:46:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:46:28,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:46:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:46:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:46:28,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:46:28,671 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 21:46:29,435 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:46:29,436 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:46:29,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:46:29 BoogieIcfgContainer [2019-12-27 21:46:29,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:46:29,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:46:29,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:46:29,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:46:29,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:46:27" (1/3) ... [2019-12-27 21:46:29,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e2d89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:46:29, skipping insertion in model container [2019-12-27 21:46:29,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:28" (2/3) ... [2019-12-27 21:46:29,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e2d89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:46:29, skipping insertion in model container [2019-12-27 21:46:29,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:46:29" (3/3) ... [2019-12-27 21:46:29,447 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_pso.oepc.i [2019-12-27 21:46:29,457 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:46:29,458 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:46:29,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:46:29,467 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:46:29,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,510 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,510 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,510 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,520 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,520 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,575 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,585 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,585 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,590 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:29,609 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:46:29,631 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:46:29,631 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:46:29,631 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:46:29,631 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:46:29,631 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:46:29,632 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:46:29,632 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:46:29,632 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:46:29,649 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 21:46:29,651 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:46:29,785 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:46:29,785 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:46:29,805 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:46:29,828 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:46:29,912 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:46:29,912 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:46:29,920 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:46:29,941 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:46:29,943 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:46:33,397 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 21:46:33,534 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:46:33,572 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-27 21:46:33,572 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 21:46:33,576 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-27 21:46:55,928 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 21:46:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 21:46:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:46:55,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:55,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:46:55,937 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 21:46:55,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:55,943 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-27 21:46:55,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:55,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683723033] [2019-12-27 21:46:55,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:56,179 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 21:46:56,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683723033] [2019-12-27 21:46:56,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:56,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:46:56,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132428643] [2019-12-27 21:46:56,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:56,186 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:56,197 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:46:56,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:56,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:46:56,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:46:56,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:56,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:46:56,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:46:56,214 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 21:46:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:57,686 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-27 21:46:57,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:46:57,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:46:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:01,881 INFO L225 Difference]: With dead ends: 120110 [2019-12-27 21:47:01,882 INFO L226 Difference]: Without dead ends: 112648 [2019-12-27 21:47:01,883 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 21:47:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-27 21:47:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-27 21:47:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-27 21:47:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-27 21:47:13,168 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-27 21:47:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:13,169 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-27 21:47:13,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:47:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-27 21:47:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:47:13,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:13,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:13,174 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 21:47:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-27 21:47:13,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:13,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2381558] [2019-12-27 21:47:13,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:13,302 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 21:47:13,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2381558] [2019-12-27 21:47:13,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:13,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:47:13,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739248461] [2019-12-27 21:47:13,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:13,305 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:13,308 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:47:13,308 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:13,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:13,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:47:13,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:47:13,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:47:13,311 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-27 21:47:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:18,952 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-27 21:47:18,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:47:18,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:47:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:19,547 INFO L225 Difference]: With dead ends: 175220 [2019-12-27 21:47:19,547 INFO L226 Difference]: Without dead ends: 175171 [2019-12-27 21:47:19,548 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 21:47:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-27 21:47:29,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-27 21:47:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-27 21:47:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-27 21:47:29,620 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-27 21:47:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:29,620 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-27 21:47:29,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:47:29,620 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-27 21:47:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:47:29,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:29,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:29,628 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 21:47:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-27 21:47:29,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:29,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692896008] [2019-12-27 21:47:29,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:29,694 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 21:47:29,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692896008] [2019-12-27 21:47:29,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:29,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:47:29,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631208672] [2019-12-27 21:47:29,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:29,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:29,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:47:29,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:29,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:29,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:47:29,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:29,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:47:29,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:29,700 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-27 21:47:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:29,862 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-27 21:47:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:47:29,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:47:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:29,933 INFO L225 Difference]: With dead ends: 34935 [2019-12-27 21:47:29,933 INFO L226 Difference]: Without dead ends: 34935 [2019-12-27 21:47:29,934 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 21:47:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-27 21:47:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-27 21:47:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-27 21:47:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-27 21:47:35,901 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-27 21:47:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:35,901 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-27 21:47:35,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:47:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-27 21:47:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:47:35,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:35,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:35,904 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 21:47:35,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-27 21:47:35,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:35,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375784798] [2019-12-27 21:47:35,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:35,960 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 21:47:35,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375784798] [2019-12-27 21:47:35,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:35,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:47:35,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786373241] [2019-12-27 21:47:35,962 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:35,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:35,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:47:35,966 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:35,967 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:35,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:47:35,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:47:35,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:35,968 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-27 21:47:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:36,191 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-27 21:47:36,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:47:36,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:47:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:36,294 INFO L225 Difference]: With dead ends: 52469 [2019-12-27 21:47:36,295 INFO L226 Difference]: Without dead ends: 52469 [2019-12-27 21:47:36,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-27 21:47:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-27 21:47:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-27 21:47:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-27 21:47:37,491 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-27 21:47:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:37,498 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-27 21:47:37,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:47:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-27 21:47:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:47:37,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:37,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:37,502 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 21:47:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-27 21:47:37,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:37,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91739977] [2019-12-27 21:47:37,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:37,640 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 21:47:37,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91739977] [2019-12-27 21:47:37,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:37,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:47:37,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1287399158] [2019-12-27 21:47:37,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:37,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:37,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:47:37,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:37,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:37,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:47:37,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:37,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:47:37,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:47:37,649 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-27 21:47:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:38,217 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-27 21:47:38,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:47:38,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:47:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:38,313 INFO L225 Difference]: With dead ends: 54128 [2019-12-27 21:47:38,313 INFO L226 Difference]: Without dead ends: 54128 [2019-12-27 21:47:38,313 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 21:47:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-27 21:47:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-27 21:47:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-27 21:47:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-27 21:47:39,847 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-27 21:47:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:39,847 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-27 21:47:39,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:47:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-27 21:47:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:47:39,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:39,862 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 21:47:39,862 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 21:47:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-27 21:47:39,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:39,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383049365] [2019-12-27 21:47:39,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:39,954 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 21:47:39,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383049365] [2019-12-27 21:47:39,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:39,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:47:39,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259070899] [2019-12-27 21:47:39,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:39,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:39,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 21:47:39,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:40,014 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:47:40,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:47:40,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:40,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:47:40,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:47:40,015 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 7 states. [2019-12-27 21:47:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:41,047 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-27 21:47:41,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:47:41,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 21:47:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:41,160 INFO L225 Difference]: With dead ends: 67629 [2019-12-27 21:47:41,160 INFO L226 Difference]: Without dead ends: 67622 [2019-12-27 21:47:41,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:47:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-27 21:47:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-27 21:47:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-27 21:47:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-27 21:47:42,142 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-27 21:47:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:42,142 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-27 21:47:42,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:47:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-27 21:47:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:47:42,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:42,161 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 21:47:42,161 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 21:47:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-27 21:47:42,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:42,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257614998] [2019-12-27 21:47:42,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:42,235 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 21:47:42,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257614998] [2019-12-27 21:47:42,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:42,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:47:42,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1258436098] [2019-12-27 21:47:42,236 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:42,240 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:42,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:47:42,594 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:42,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:47:42,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:47:42,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:42,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:47:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:47:42,620 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 5 states. [2019-12-27 21:47:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:42,725 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-27 21:47:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:47:42,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:47:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:42,753 INFO L225 Difference]: With dead ends: 18428 [2019-12-27 21:47:42,753 INFO L226 Difference]: Without dead ends: 18428 [2019-12-27 21:47:42,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:47:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-27 21:47:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-27 21:47:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-27 21:47:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-27 21:47:43,045 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-27 21:47:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:43,045 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-27 21:47:43,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:47:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-27 21:47:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:47:43,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:43,060 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 21:47:43,060 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 21:47:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:43,061 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-27 21:47:43,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:43,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077447694] [2019-12-27 21:47:43,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:43,162 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 21:47:43,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077447694] [2019-12-27 21:47:43,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:43,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:47:43,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1195210576] [2019-12-27 21:47:43,167 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:43,170 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:43,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:47:43,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:43,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:43,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:47:43,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:43,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:47:43,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:47:43,178 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-27 21:47:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:43,842 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-27 21:47:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:47:43,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:47:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:43,896 INFO L225 Difference]: With dead ends: 25507 [2019-12-27 21:47:43,896 INFO L226 Difference]: Without dead ends: 25507 [2019-12-27 21:47:43,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:47:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-27 21:47:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-27 21:47:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-27 21:47:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-27 21:47:44,389 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-27 21:47:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:44,389 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-27 21:47:44,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:47:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-27 21:47:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:47:44,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:44,413 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 21:47:44,413 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 21:47:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:44,414 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-27 21:47:44,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:44,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774559518] [2019-12-27 21:47:44,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:44,556 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 21:47:44,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774559518] [2019-12-27 21:47:44,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:44,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:47:44,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448319175] [2019-12-27 21:47:44,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:44,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:44,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 21:47:44,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:44,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:47:44,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:47:44,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:44,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:47:44,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:47:44,598 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 8 states. [2019-12-27 21:47:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:45,778 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-27 21:47:45,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:47:45,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 21:47:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:45,821 INFO L225 Difference]: With dead ends: 28486 [2019-12-27 21:47:45,821 INFO L226 Difference]: Without dead ends: 28486 [2019-12-27 21:47:45,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:47:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-27 21:47:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-27 21:47:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-27 21:47:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-27 21:47:46,462 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-27 21:47:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:46,463 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-27 21:47:46,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:47:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-27 21:47:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:47:46,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:46,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:46,490 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 21:47:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-27 21:47:46,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:46,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259414372] [2019-12-27 21:47:46,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:46,574 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 21:47:46,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259414372] [2019-12-27 21:47:46,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:46,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:47:46,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1598817185] [2019-12-27 21:47:46,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:46,583 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:46,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 21:47:46,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:46,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:47:46,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:47:46,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:47:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:47:46,697 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 8 states. [2019-12-27 21:47:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:47,807 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-27 21:47:47,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:47:47,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 21:47:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:47,851 INFO L225 Difference]: With dead ends: 28283 [2019-12-27 21:47:47,852 INFO L226 Difference]: Without dead ends: 28283 [2019-12-27 21:47:47,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:47:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-27 21:47:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-27 21:47:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-27 21:47:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-27 21:47:48,283 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-27 21:47:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:48,283 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-27 21:47:48,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:47:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-27 21:47:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:47:48,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:48,314 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 21:47:48,314 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 21:47:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-27 21:47:48,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:48,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877406958] [2019-12-27 21:47:48,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:48,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877406958] [2019-12-27 21:47:48,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:48,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:47:48,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039740907] [2019-12-27 21:47:48,415 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:48,423 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:48,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 331 transitions. [2019-12-27 21:47:48,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:48,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:48,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:47:48,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:48,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:47:48,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:48,486 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 3 states. [2019-12-27 21:47:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:48,581 INFO L93 Difference]: Finished difference Result 26386 states and 81161 transitions. [2019-12-27 21:47:48,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:47:48,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 21:47:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:48,622 INFO L225 Difference]: With dead ends: 26386 [2019-12-27 21:47:48,623 INFO L226 Difference]: Without dead ends: 26386 [2019-12-27 21:47:48,623 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 21:47:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26386 states. [2019-12-27 21:47:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26386 to 22631. [2019-12-27 21:47:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22631 states. [2019-12-27 21:47:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22631 states to 22631 states and 70743 transitions. [2019-12-27 21:47:49,296 INFO L78 Accepts]: Start accepts. Automaton has 22631 states and 70743 transitions. Word has length 39 [2019-12-27 21:47:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:49,297 INFO L462 AbstractCegarLoop]: Abstraction has 22631 states and 70743 transitions. [2019-12-27 21:47:49,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:47:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 22631 states and 70743 transitions. [2019-12-27 21:47:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:47:49,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:49,320 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 21:47:49,321 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 21:47:49,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:49,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1172451276, now seen corresponding path program 1 times [2019-12-27 21:47:49,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:49,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68616690] [2019-12-27 21:47:49,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:49,388 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 21:47:49,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68616690] [2019-12-27 21:47:49,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:49,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:47:49,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1460037601] [2019-12-27 21:47:49,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:49,397 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:49,465 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 329 transitions. [2019-12-27 21:47:49,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:49,509 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:47:49,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:47:49,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:49,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:47:49,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:47:49,510 INFO L87 Difference]: Start difference. First operand 22631 states and 70743 transitions. Second operand 7 states. [2019-12-27 21:47:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:49,637 INFO L93 Difference]: Finished difference Result 21311 states and 67738 transitions. [2019-12-27 21:47:49,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:47:49,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:47:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:49,676 INFO L225 Difference]: With dead ends: 21311 [2019-12-27 21:47:49,676 INFO L226 Difference]: Without dead ends: 21311 [2019-12-27 21:47:49,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 21:47:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21311 states. [2019-12-27 21:47:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21311 to 21311. [2019-12-27 21:47:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21311 states. [2019-12-27 21:47:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21311 states to 21311 states and 67738 transitions. [2019-12-27 21:47:49,992 INFO L78 Accepts]: Start accepts. Automaton has 21311 states and 67738 transitions. Word has length 40 [2019-12-27 21:47:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:49,993 INFO L462 AbstractCegarLoop]: Abstraction has 21311 states and 67738 transitions. [2019-12-27 21:47:49,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:47:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 21311 states and 67738 transitions. [2019-12-27 21:47:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:47:50,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:50,022 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 21:47:50,022 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 21:47:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 236633210, now seen corresponding path program 1 times [2019-12-27 21:47:50,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:50,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375336888] [2019-12-27 21:47:50,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:50,117 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 21:47:50,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375336888] [2019-12-27 21:47:50,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:50,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:47:50,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162354419] [2019-12-27 21:47:50,118 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:50,147 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:50,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 322 transitions. [2019-12-27 21:47:50,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:50,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:47:50,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:47:50,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:50,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:47:50,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:47:50,393 INFO L87 Difference]: Start difference. First operand 21311 states and 67738 transitions. Second operand 8 states. [2019-12-27 21:47:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:51,305 INFO L93 Difference]: Finished difference Result 72190 states and 228328 transitions. [2019-12-27 21:47:51,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:47:51,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 21:47:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:51,767 INFO L225 Difference]: With dead ends: 72190 [2019-12-27 21:47:51,767 INFO L226 Difference]: Without dead ends: 59049 [2019-12-27 21:47:51,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:47:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59049 states. [2019-12-27 21:47:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59049 to 24967. [2019-12-27 21:47:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24967 states. [2019-12-27 21:47:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24967 states to 24967 states and 79925 transitions. [2019-12-27 21:47:52,413 INFO L78 Accepts]: Start accepts. Automaton has 24967 states and 79925 transitions. Word has length 65 [2019-12-27 21:47:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:52,413 INFO L462 AbstractCegarLoop]: Abstraction has 24967 states and 79925 transitions. [2019-12-27 21:47:52,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:47:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 24967 states and 79925 transitions. [2019-12-27 21:47:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:47:52,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:52,451 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 21:47:52,451 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 21:47:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash 896785052, now seen corresponding path program 2 times [2019-12-27 21:47:52,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:52,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075735216] [2019-12-27 21:47:52,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:52,545 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 21:47:52,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075735216] [2019-12-27 21:47:52,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:52,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:47:52,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [329389521] [2019-12-27 21:47:52,546 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:52,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:52,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 276 transitions. [2019-12-27 21:47:52,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:52,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:47:52,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:47:52,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:52,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:47:52,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:47:52,731 INFO L87 Difference]: Start difference. First operand 24967 states and 79925 transitions. Second operand 10 states. [2019-12-27 21:47:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:54,816 INFO L93 Difference]: Finished difference Result 76936 states and 243966 transitions. [2019-12-27 21:47:54,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:47:54,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 21:47:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:54,911 INFO L225 Difference]: With dead ends: 76936 [2019-12-27 21:47:54,911 INFO L226 Difference]: Without dead ends: 57435 [2019-12-27 21:47:54,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:47:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57435 states. [2019-12-27 21:47:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57435 to 29639. [2019-12-27 21:47:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29639 states. [2019-12-27 21:47:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29639 states to 29639 states and 94665 transitions. [2019-12-27 21:47:56,042 INFO L78 Accepts]: Start accepts. Automaton has 29639 states and 94665 transitions. Word has length 65 [2019-12-27 21:47:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:56,042 INFO L462 AbstractCegarLoop]: Abstraction has 29639 states and 94665 transitions. [2019-12-27 21:47:56,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:47:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 29639 states and 94665 transitions. [2019-12-27 21:47:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:47:56,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:56,079 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 21:47:56,079 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 21:47:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1620990666, now seen corresponding path program 3 times [2019-12-27 21:47:56,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:56,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617259395] [2019-12-27 21:47:56,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:56,180 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 21:47:56,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617259395] [2019-12-27 21:47:56,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:56,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:47:56,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [645663935] [2019-12-27 21:47:56,181 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:56,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:56,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 362 transitions. [2019-12-27 21:47:56,379 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:56,420 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:47:56,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:47:56,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:47:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:47:56,421 INFO L87 Difference]: Start difference. First operand 29639 states and 94665 transitions. Second operand 8 states. [2019-12-27 21:47:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:57,955 INFO L93 Difference]: Finished difference Result 79319 states and 248856 transitions. [2019-12-27 21:47:57,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:47:57,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 21:47:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:58,062 INFO L225 Difference]: With dead ends: 79319 [2019-12-27 21:47:58,062 INFO L226 Difference]: Without dead ends: 70462 [2019-12-27 21:47:58,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:47:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70462 states. [2019-12-27 21:47:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70462 to 29947. [2019-12-27 21:47:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29947 states. [2019-12-27 21:47:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29947 states to 29947 states and 95616 transitions. [2019-12-27 21:47:59,306 INFO L78 Accepts]: Start accepts. Automaton has 29947 states and 95616 transitions. Word has length 65 [2019-12-27 21:47:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:59,306 INFO L462 AbstractCegarLoop]: Abstraction has 29947 states and 95616 transitions. [2019-12-27 21:47:59,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:47:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 29947 states and 95616 transitions. [2019-12-27 21:47:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:47:59,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:59,343 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 21:47:59,343 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 21:47:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash 691532486, now seen corresponding path program 4 times [2019-12-27 21:47:59,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:59,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596219387] [2019-12-27 21:47:59,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:59,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596219387] [2019-12-27 21:47:59,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:59,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:47:59,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1826938219] [2019-12-27 21:47:59,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:59,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:59,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 278 states and 501 transitions. [2019-12-27 21:47:59,775 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:59,776 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:59,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:47:59,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:59,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:47:59,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:59,777 INFO L87 Difference]: Start difference. First operand 29947 states and 95616 transitions. Second operand 3 states. [2019-12-27 21:47:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:59,997 INFO L93 Difference]: Finished difference Result 34953 states and 110763 transitions. [2019-12-27 21:47:59,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:47:59,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:47:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:00,071 INFO L225 Difference]: With dead ends: 34953 [2019-12-27 21:48:00,071 INFO L226 Difference]: Without dead ends: 34953 [2019-12-27 21:48:00,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:48:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34953 states. [2019-12-27 21:48:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34953 to 30783. [2019-12-27 21:48:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30783 states. [2019-12-27 21:48:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30783 states to 30783 states and 98542 transitions. [2019-12-27 21:48:00,650 INFO L78 Accepts]: Start accepts. Automaton has 30783 states and 98542 transitions. Word has length 65 [2019-12-27 21:48:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:00,651 INFO L462 AbstractCegarLoop]: Abstraction has 30783 states and 98542 transitions. [2019-12-27 21:48:00,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:48:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30783 states and 98542 transitions. [2019-12-27 21:48:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:00,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:00,691 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 21:48:00,691 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 21:48:00,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash 868435461, now seen corresponding path program 1 times [2019-12-27 21:48:00,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:00,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929132849] [2019-12-27 21:48:00,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:01,035 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 21:48:01,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929132849] [2019-12-27 21:48:01,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:01,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:48:01,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [746382839] [2019-12-27 21:48:01,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:01,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:01,297 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 305 transitions. [2019-12-27 21:48:01,297 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:01,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:48:01,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:48:01,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:48:01,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:48:01,317 INFO L87 Difference]: Start difference. First operand 30783 states and 98542 transitions. Second operand 5 states. [2019-12-27 21:48:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:01,838 INFO L93 Difference]: Finished difference Result 53671 states and 170907 transitions. [2019-12-27 21:48:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:48:01,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 21:48:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:01,922 INFO L225 Difference]: With dead ends: 53671 [2019-12-27 21:48:01,922 INFO L226 Difference]: Without dead ends: 53671 [2019-12-27 21:48:01,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:48:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53671 states. [2019-12-27 21:48:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53671 to 34219. [2019-12-27 21:48:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34219 states. [2019-12-27 21:48:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34219 states to 34219 states and 110736 transitions. [2019-12-27 21:48:02,697 INFO L78 Accepts]: Start accepts. Automaton has 34219 states and 110736 transitions. Word has length 66 [2019-12-27 21:48:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:02,697 INFO L462 AbstractCegarLoop]: Abstraction has 34219 states and 110736 transitions. [2019-12-27 21:48:02,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:48:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 34219 states and 110736 transitions. [2019-12-27 21:48:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:02,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:02,741 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 21:48:02,741 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 21:48:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash -909174781, now seen corresponding path program 2 times [2019-12-27 21:48:02,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:02,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589274406] [2019-12-27 21:48:02,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:02,798 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 21:48:02,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589274406] [2019-12-27 21:48:02,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:02,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:48:02,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1505850059] [2019-12-27 21:48:02,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:02,820 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:03,457 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 297 transitions. [2019-12-27 21:48:03,458 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:03,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:48:03,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:48:03,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:03,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:48:03,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:48:03,469 INFO L87 Difference]: Start difference. First operand 34219 states and 110736 transitions. Second operand 3 states. [2019-12-27 21:48:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:03,883 INFO L93 Difference]: Finished difference Result 47990 states and 153962 transitions. [2019-12-27 21:48:03,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:48:03,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:48:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:03,990 INFO L225 Difference]: With dead ends: 47990 [2019-12-27 21:48:03,991 INFO L226 Difference]: Without dead ends: 47990 [2019-12-27 21:48:03,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 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 21:48:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47990 states. [2019-12-27 21:48:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47990 to 34147. [2019-12-27 21:48:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34147 states. [2019-12-27 21:48:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34147 states to 34147 states and 110505 transitions. [2019-12-27 21:48:04,682 INFO L78 Accepts]: Start accepts. Automaton has 34147 states and 110505 transitions. Word has length 66 [2019-12-27 21:48:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:04,683 INFO L462 AbstractCegarLoop]: Abstraction has 34147 states and 110505 transitions. [2019-12-27 21:48:04,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:48:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 34147 states and 110505 transitions. [2019-12-27 21:48:04,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:04,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:04,727 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 21:48:04,727 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 21:48:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash -909555473, now seen corresponding path program 3 times [2019-12-27 21:48:04,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:04,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604141810] [2019-12-27 21:48:04,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:04,806 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 21:48:04,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604141810] [2019-12-27 21:48:04,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:04,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:48:04,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83982371] [2019-12-27 21:48:04,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:04,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:04,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 280 transitions. [2019-12-27 21:48:04,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:05,006 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:48:05,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:48:05,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:05,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:48:05,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:48:05,007 INFO L87 Difference]: Start difference. First operand 34147 states and 110505 transitions. Second operand 7 states. [2019-12-27 21:48:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:05,544 INFO L93 Difference]: Finished difference Result 70843 states and 225594 transitions. [2019-12-27 21:48:05,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:48:05,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 21:48:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:05,646 INFO L225 Difference]: With dead ends: 70843 [2019-12-27 21:48:05,646 INFO L226 Difference]: Without dead ends: 65288 [2019-12-27 21:48:05,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:48:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65288 states. [2019-12-27 21:48:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65288 to 34211. [2019-12-27 21:48:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34211 states. [2019-12-27 21:48:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34211 states to 34211 states and 110723 transitions. [2019-12-27 21:48:06,897 INFO L78 Accepts]: Start accepts. Automaton has 34211 states and 110723 transitions. Word has length 66 [2019-12-27 21:48:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:06,898 INFO L462 AbstractCegarLoop]: Abstraction has 34211 states and 110723 transitions. [2019-12-27 21:48:06,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:48:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 34211 states and 110723 transitions. [2019-12-27 21:48:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:06,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:06,938 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 21:48:06,938 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 21:48:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash 862222067, now seen corresponding path program 4 times [2019-12-27 21:48:06,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:06,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065572807] [2019-12-27 21:48:06,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:07,040 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 21:48:07,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065572807] [2019-12-27 21:48:07,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:07,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:48:07,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [469830577] [2019-12-27 21:48:07,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:07,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:07,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 388 transitions. [2019-12-27 21:48:07,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:07,456 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:48:07,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:48:07,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:07,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:48:07,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:48:07,457 INFO L87 Difference]: Start difference. First operand 34211 states and 110723 transitions. Second operand 10 states. [2019-12-27 21:48:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:09,383 INFO L93 Difference]: Finished difference Result 83834 states and 266867 transitions. [2019-12-27 21:48:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 21:48:09,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 21:48:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:09,520 INFO L225 Difference]: With dead ends: 83834 [2019-12-27 21:48:09,521 INFO L226 Difference]: Without dead ends: 83834 [2019-12-27 21:48:09,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:48:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83834 states. [2019-12-27 21:48:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83834 to 31961. [2019-12-27 21:48:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31961 states. [2019-12-27 21:48:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31961 states to 31961 states and 102260 transitions. [2019-12-27 21:48:10,971 INFO L78 Accepts]: Start accepts. Automaton has 31961 states and 102260 transitions. Word has length 66 [2019-12-27 21:48:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:10,971 INFO L462 AbstractCegarLoop]: Abstraction has 31961 states and 102260 transitions. [2019-12-27 21:48:10,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:48:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 31961 states and 102260 transitions. [2019-12-27 21:48:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:11,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:11,012 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 21:48:11,013 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 21:48:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash 605319499, now seen corresponding path program 5 times [2019-12-27 21:48:11,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:11,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806704770] [2019-12-27 21:48:11,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:11,095 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 21:48:11,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806704770] [2019-12-27 21:48:11,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:11,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:48:11,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079325366] [2019-12-27 21:48:11,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:11,115 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:11,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 415 transitions. [2019-12-27 21:48:11,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:11,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:48:11,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:48:11,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:11,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:48:11,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:48:11,346 INFO L87 Difference]: Start difference. First operand 31961 states and 102260 transitions. Second operand 4 states. [2019-12-27 21:48:11,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:11,652 INFO L93 Difference]: Finished difference Result 38169 states and 121703 transitions. [2019-12-27 21:48:11,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:48:11,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:48:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:11,741 INFO L225 Difference]: With dead ends: 38169 [2019-12-27 21:48:11,741 INFO L226 Difference]: Without dead ends: 38169 [2019-12-27 21:48:11,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:48:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38169 states. [2019-12-27 21:48:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38169 to 31976. [2019-12-27 21:48:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-27 21:48:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-27 21:48:12,350 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 66 [2019-12-27 21:48:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:12,351 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-27 21:48:12,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:48:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-27 21:48:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:12,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:12,388 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 21:48:12,388 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 21:48:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-27 21:48:12,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:12,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066647159] [2019-12-27 21:48:12,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:12,442 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 21:48:12,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066647159] [2019-12-27 21:48:12,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:12,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:48:12,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1307657464] [2019-12-27 21:48:12,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:12,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:13,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 280 states and 502 transitions. [2019-12-27 21:48:13,028 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:13,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:48:13,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:48:13,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:13,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:48:13,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:48:13,039 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 4 states. [2019-12-27 21:48:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:13,351 INFO L93 Difference]: Finished difference Result 34683 states and 108446 transitions. [2019-12-27 21:48:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:48:13,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:48:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:13,410 INFO L225 Difference]: With dead ends: 34683 [2019-12-27 21:48:13,410 INFO L226 Difference]: Without dead ends: 34683 [2019-12-27 21:48:13,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:48:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34683 states. [2019-12-27 21:48:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34683 to 24273. [2019-12-27 21:48:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-27 21:48:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-27 21:48:13,865 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-27 21:48:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:13,865 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-27 21:48:13,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:48:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-27 21:48:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:13,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:13,893 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 21:48:13,893 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 21:48:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-27 21:48:13,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:13,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043833944] [2019-12-27 21:48:13,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:14,066 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 21:48:14,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043833944] [2019-12-27 21:48:14,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:14,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:48:14,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1925959447] [2019-12-27 21:48:14,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:14,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:14,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 322 transitions. [2019-12-27 21:48:14,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:14,418 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:48:14,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:48:14,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:48:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:48:14,419 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 12 states. [2019-12-27 21:48:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:16,205 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-27 21:48:16,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:48:16,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 21:48:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:16,248 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 21:48:16,248 INFO L226 Difference]: Without dead ends: 28791 [2019-12-27 21:48:16,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:48:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-27 21:48:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-27 21:48:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-27 21:48:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-27 21:48:16,665 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-27 21:48:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:16,665 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-27 21:48:16,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:48:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-27 21:48:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:16,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:16,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:16,693 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 21:48:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-27 21:48:16,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:16,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332989788] [2019-12-27 21:48:16,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:17,177 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 21:48:17,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332989788] [2019-12-27 21:48:17,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:17,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:48:17,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1704433964] [2019-12-27 21:48:17,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:17,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:17,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 341 transitions. [2019-12-27 21:48:17,501 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:17,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:48:17,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:48:17,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:17,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:48:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:48:17,643 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 13 states. [2019-12-27 21:48:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:19,995 INFO L93 Difference]: Finished difference Result 45644 states and 141958 transitions. [2019-12-27 21:48:19,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:48:19,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 21:48:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:20,055 INFO L225 Difference]: With dead ends: 45644 [2019-12-27 21:48:20,055 INFO L226 Difference]: Without dead ends: 40426 [2019-12-27 21:48:20,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:48:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40426 states. [2019-12-27 21:48:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40426 to 25169. [2019-12-27 21:48:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-27 21:48:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-27 21:48:20,569 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-27 21:48:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:20,569 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-27 21:48:20,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:48:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-27 21:48:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:20,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:20,597 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 21:48:20,597 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 21:48:20,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:20,597 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-27 21:48:20,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:20,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114578973] [2019-12-27 21:48:20,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:20,761 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 21:48:20,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114578973] [2019-12-27 21:48:20,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:20,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:48:20,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213245849] [2019-12-27 21:48:20,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:20,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:21,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 302 states and 617 transitions. [2019-12-27 21:48:21,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:21,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:48:21,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:48:21,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 21:48:21,975 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:48:21,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:48:21,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 21:48:21,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 21:48:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:48:21,978 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 19 states. [2019-12-27 21:48:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:25,512 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-27 21:48:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:48:25,513 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 21:48:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:25,557 INFO L225 Difference]: With dead ends: 34459 [2019-12-27 21:48:25,557 INFO L226 Difference]: Without dead ends: 30448 [2019-12-27 21:48:25,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:48:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-27 21:48:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-27 21:48:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-27 21:48:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-27 21:48:25,983 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-27 21:48:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:25,983 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-27 21:48:25,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 21:48:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-27 21:48:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:26,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:26,011 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 21:48:26,011 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 21:48:26,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-27 21:48:26,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:26,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878176159] [2019-12-27 21:48:26,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:26,166 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 21:48:26,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878176159] [2019-12-27 21:48:26,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:26,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:48:26,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375281621] [2019-12-27 21:48:26,167 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:26,180 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:26,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 324 transitions. [2019-12-27 21:48:26,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:26,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:48:26,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:48:26,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:26,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:48:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:48:26,452 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 14 states. [2019-12-27 21:48:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:28,927 INFO L93 Difference]: Finished difference Result 35238 states and 110385 transitions. [2019-12-27 21:48:28,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:48:28,927 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 21:48:28,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:28,978 INFO L225 Difference]: With dead ends: 35238 [2019-12-27 21:48:28,978 INFO L226 Difference]: Without dead ends: 30725 [2019-12-27 21:48:28,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:48:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30725 states. [2019-12-27 21:48:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30725 to 25253. [2019-12-27 21:48:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25253 states. [2019-12-27 21:48:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25253 states to 25253 states and 78938 transitions. [2019-12-27 21:48:29,766 INFO L78 Accepts]: Start accepts. Automaton has 25253 states and 78938 transitions. Word has length 67 [2019-12-27 21:48:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:29,766 INFO L462 AbstractCegarLoop]: Abstraction has 25253 states and 78938 transitions. [2019-12-27 21:48:29,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:48:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 25253 states and 78938 transitions. [2019-12-27 21:48:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:29,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:29,795 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 21:48:29,795 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 21:48:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:29,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1968134607, now seen corresponding path program 5 times [2019-12-27 21:48:29,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:29,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640673403] [2019-12-27 21:48:29,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:29,967 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 21:48:29,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640673403] [2019-12-27 21:48:29,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:29,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:48:29,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2112560530] [2019-12-27 21:48:29,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:29,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:30,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 306 states and 636 transitions. [2019-12-27 21:48:30,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:30,463 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 21:48:30,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:48:30,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:30,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:48:30,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:48:30,464 INFO L87 Difference]: Start difference. First operand 25253 states and 78938 transitions. Second operand 16 states. [2019-12-27 21:48:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:33,475 INFO L93 Difference]: Finished difference Result 63938 states and 199857 transitions. [2019-12-27 21:48:33,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 21:48:33,476 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 21:48:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:33,567 INFO L225 Difference]: With dead ends: 63938 [2019-12-27 21:48:33,568 INFO L226 Difference]: Without dead ends: 61390 [2019-12-27 21:48:33,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=373, Invalid=1789, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 21:48:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61390 states. [2019-12-27 21:48:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61390 to 28694. [2019-12-27 21:48:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28694 states. [2019-12-27 21:48:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28694 states to 28694 states and 89867 transitions. [2019-12-27 21:48:34,269 INFO L78 Accepts]: Start accepts. Automaton has 28694 states and 89867 transitions. Word has length 67 [2019-12-27 21:48:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:34,269 INFO L462 AbstractCegarLoop]: Abstraction has 28694 states and 89867 transitions. [2019-12-27 21:48:34,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:48:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 28694 states and 89867 transitions. [2019-12-27 21:48:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:34,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:34,301 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 21:48:34,302 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 21:48:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1218502995, now seen corresponding path program 6 times [2019-12-27 21:48:34,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:34,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469924664] [2019-12-27 21:48:34,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:34,479 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 21:48:34,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469924664] [2019-12-27 21:48:34,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:34,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:48:34,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090910282] [2019-12-27 21:48:34,480 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:34,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:34,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 334 states and 707 transitions. [2019-12-27 21:48:34,931 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:35,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:48:35,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:48:35,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 21:48:35,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 21:48:35,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 21:48:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:48:35,291 INFO L87 Difference]: Start difference. First operand 28694 states and 89867 transitions. Second operand 19 states. [2019-12-27 21:48:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:40,279 INFO L93 Difference]: Finished difference Result 74634 states and 229315 transitions. [2019-12-27 21:48:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 21:48:40,280 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 21:48:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:40,390 INFO L225 Difference]: With dead ends: 74634 [2019-12-27 21:48:40,390 INFO L226 Difference]: Without dead ends: 72889 [2019-12-27 21:48:40,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=449, Invalid=2631, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 21:48:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72889 states. [2019-12-27 21:48:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72889 to 28602. [2019-12-27 21:48:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28602 states. [2019-12-27 21:48:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28602 states to 28602 states and 89561 transitions. [2019-12-27 21:48:41,154 INFO L78 Accepts]: Start accepts. Automaton has 28602 states and 89561 transitions. Word has length 67 [2019-12-27 21:48:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:41,154 INFO L462 AbstractCegarLoop]: Abstraction has 28602 states and 89561 transitions. [2019-12-27 21:48:41,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 21:48:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 28602 states and 89561 transitions. [2019-12-27 21:48:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:41,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:41,187 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 21:48:41,187 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 21:48:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1272640249, now seen corresponding path program 7 times [2019-12-27 21:48:41,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:41,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454306240] [2019-12-27 21:48:41,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:41,379 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-27 21:48:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:41,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454306240] [2019-12-27 21:48:41,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:41,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:48:41,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [993487550] [2019-12-27 21:48:41,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:41,482 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:41,722 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 631 transitions. [2019-12-27 21:48:41,722 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:41,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 21:48:41,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 21:48:41,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:41,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 21:48:41,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:48:41,971 INFO L87 Difference]: Start difference. First operand 28602 states and 89561 transitions. Second operand 17 states. [2019-12-27 21:48:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:48,973 INFO L93 Difference]: Finished difference Result 113195 states and 349435 transitions. [2019-12-27 21:48:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-27 21:48:48,973 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 21:48:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:49,090 INFO L225 Difference]: With dead ends: 113195 [2019-12-27 21:48:49,091 INFO L226 Difference]: Without dead ends: 73706 [2019-12-27 21:48:49,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3979 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1546, Invalid=9584, Unknown=0, NotChecked=0, Total=11130 [2019-12-27 21:48:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73706 states. [2019-12-27 21:48:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73706 to 27538. [2019-12-27 21:48:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27538 states. [2019-12-27 21:48:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27538 states to 27538 states and 86001 transitions. [2019-12-27 21:48:50,151 INFO L78 Accepts]: Start accepts. Automaton has 27538 states and 86001 transitions. Word has length 67 [2019-12-27 21:48:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:50,152 INFO L462 AbstractCegarLoop]: Abstraction has 27538 states and 86001 transitions. [2019-12-27 21:48:50,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 21:48:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 27538 states and 86001 transitions. [2019-12-27 21:48:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:50,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:50,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:50,183 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 21:48:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 8 times [2019-12-27 21:48:50,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:50,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862039599] [2019-12-27 21:48:50,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:50,391 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 21:48:50,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862039599] [2019-12-27 21:48:50,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:50,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:48:50,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1506427123] [2019-12-27 21:48:50,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:50,423 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:50,849 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 310 states and 633 transitions. [2019-12-27 21:48:50,849 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:51,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 21:48:51,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:48:51,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:51,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:48:51,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:48:51,243 INFO L87 Difference]: Start difference. First operand 27538 states and 86001 transitions. Second operand 16 states. [2019-12-27 21:48:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:52,864 INFO L93 Difference]: Finished difference Result 46166 states and 143223 transitions. [2019-12-27 21:48:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:48:52,864 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 21:48:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:52,936 INFO L225 Difference]: With dead ends: 46166 [2019-12-27 21:48:52,936 INFO L226 Difference]: Without dead ends: 45923 [2019-12-27 21:48:52,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2019-12-27 21:48:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45923 states. [2019-12-27 21:48:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45923 to 27522. [2019-12-27 21:48:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27522 states. [2019-12-27 21:48:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27522 states to 27522 states and 85961 transitions. [2019-12-27 21:48:53,519 INFO L78 Accepts]: Start accepts. Automaton has 27522 states and 85961 transitions. Word has length 67 [2019-12-27 21:48:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:53,520 INFO L462 AbstractCegarLoop]: Abstraction has 27522 states and 85961 transitions. [2019-12-27 21:48:53,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:48:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 27522 states and 85961 transitions. [2019-12-27 21:48:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:53,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:53,553 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 21:48:53,553 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 21:48:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:53,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1590469371, now seen corresponding path program 9 times [2019-12-27 21:48:53,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:53,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107838387] [2019-12-27 21:48:53,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:48:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:48:53,663 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:48:53,663 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:48:53,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= |v_ULTIMATE.start_main_~#t1567~0.offset_16| 0) (= 0 v_~z$w_buff0~0_27) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1567~0.base_21|) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= (select .cse0 |v_ULTIMATE.start_main_~#t1567~0.base_21|) 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1567~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1567~0.base_21|) |v_ULTIMATE.start_main_~#t1567~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1567~0.base_21| 4)) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1567~0.base_21| 1) |v_#valid_59|) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1567~0.offset=|v_ULTIMATE.start_main_~#t1567~0.offset_16|, ULTIMATE.start_main_~#t1568~0.base=|v_ULTIMATE.start_main_~#t1568~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t1567~0.base=|v_ULTIMATE.start_main_~#t1567~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1568~0.offset=|v_ULTIMATE.start_main_~#t1568~0.offset_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1569~0.base=|v_ULTIMATE.start_main_~#t1569~0.base_19|, ULTIMATE.start_main_~#t1569~0.offset=|v_ULTIMATE.start_main_~#t1569~0.offset_15|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1567~0.offset, ULTIMATE.start_main_~#t1568~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1567~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1568~0.offset, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1569~0.base, ULTIMATE.start_main_~#t1569~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:48:53,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1568~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1568~0.base_11|)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1568~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1568~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1568~0.base_11|) |v_ULTIMATE.start_main_~#t1568~0.offset_9| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1568~0.offset_9| 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1568~0.base_11| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1568~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1568~0.base=|v_ULTIMATE.start_main_~#t1568~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1568~0.offset=|v_ULTIMATE.start_main_~#t1568~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1568~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1568~0.offset] because there is no mapped edge [2019-12-27 21:48:53,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:48:53,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In897568364 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In897568364 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out897568364| ~z$w_buff1~0_In897568364) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out897568364| ~z~0_In897568364)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In897568364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In897568364, ~z$w_buff1~0=~z$w_buff1~0_In897568364, ~z~0=~z~0_In897568364} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out897568364|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In897568364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In897568364, ~z$w_buff1~0=~z$w_buff1~0_In897568364, ~z~0=~z~0_In897568364} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 21:48:53,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 21:48:53,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1569~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1569~0.base_13|) |v_ULTIMATE.start_main_~#t1569~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1569~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1569~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1569~0.base_13| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1569~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1569~0.offset_11| 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1569~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1569~0.base=|v_ULTIMATE.start_main_~#t1569~0.base_13|, ULTIMATE.start_main_~#t1569~0.offset=|v_ULTIMATE.start_main_~#t1569~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1569~0.base, ULTIMATE.start_main_~#t1569~0.offset, #length] because there is no mapped edge [2019-12-27 21:48:53,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1365800527 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1365800527 256)))) (or (and (= ~z$w_buff0_used~0_In1365800527 |P1Thread1of1ForFork2_#t~ite11_Out1365800527|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1365800527|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1365800527, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1365800527} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1365800527, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1365800527|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1365800527} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:48:53,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-53688343 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-53688343 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-53688343 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-53688343 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-53688343|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-53688343 |P1Thread1of1ForFork2_#t~ite12_Out-53688343|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-53688343, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-53688343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-53688343, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-53688343} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-53688343, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-53688343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-53688343, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-53688343|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-53688343} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:48:53,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1999424992 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1999424992 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1999424992|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-1999424992 |P1Thread1of1ForFork2_#t~ite13_Out-1999424992|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1999424992, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1999424992} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1999424992, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1999424992|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1999424992} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:48:53,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1030665230 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1030665230 256)))) (or (and (= ~z$w_buff0_used~0_In-1030665230 |P0Thread1of1ForFork1_#t~ite5_Out-1030665230|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1030665230| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1030665230, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1030665230} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1030665230|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1030665230, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1030665230} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:48:53,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In861574684 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In861574684 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In861574684 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In861574684 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In861574684 |P0Thread1of1ForFork1_#t~ite6_Out861574684|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out861574684|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In861574684, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In861574684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861574684, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In861574684} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In861574684, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out861574684|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In861574684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861574684, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In861574684} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:48:53,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1606246009 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1606246009 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out1606246009 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out1606246009 ~z$r_buff0_thd1~0_In1606246009)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1606246009, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1606246009} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1606246009, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1606246009|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1606246009} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:48:53,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-714140774 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-714140774 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-714140774 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-714140774 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-714140774| ~z$r_buff1_thd1~0_In-714140774) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-714140774| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-714140774, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-714140774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-714140774, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-714140774} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-714140774|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-714140774, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-714140774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-714140774, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-714140774} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:48:53,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:48:53,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In2123667480 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2123667480 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2123667480 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In2123667480 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out2123667480|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In2123667480 |P1Thread1of1ForFork2_#t~ite14_Out2123667480|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2123667480, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2123667480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123667480, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2123667480} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2123667480, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2123667480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123667480, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out2123667480|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2123667480} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:48:53,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:48:53,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In933806911 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In933806911 256) 0))) (or (and .cse0 (= (mod ~z$r_buff1_thd3~0_In933806911 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In933806911 256)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In933806911 256))))) (= ~z$w_buff0_used~0_In933806911 |P2Thread1of1ForFork0_#t~ite26_Out933806911|) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out933806911| |P2Thread1of1ForFork0_#t~ite26_Out933806911|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In933806911| |P2Thread1of1ForFork0_#t~ite26_Out933806911|) (= ~z$w_buff0_used~0_In933806911 |P2Thread1of1ForFork0_#t~ite27_Out933806911|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In933806911|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In933806911, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In933806911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In933806911, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In933806911, ~weak$$choice2~0=~weak$$choice2~0_In933806911} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out933806911|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out933806911|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In933806911, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In933806911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In933806911, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In933806911, ~weak$$choice2~0=~weak$$choice2~0_In933806911} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 21:48:53,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:48:53,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:48:53,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1598372066 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1598372066 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-1598372066| |P2Thread1of1ForFork0_#t~ite38_Out-1598372066|))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1598372066| ~z$w_buff1~0_In-1598372066) .cse2) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1598372066| ~z~0_In-1598372066) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1598372066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1598372066, ~z$w_buff1~0=~z$w_buff1~0_In-1598372066, ~z~0=~z~0_In-1598372066} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1598372066|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1598372066|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1598372066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1598372066, ~z$w_buff1~0=~z$w_buff1~0_In-1598372066, ~z~0=~z~0_In-1598372066} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:48:53,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2068831924 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2068831924 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-2068831924| ~z$w_buff0_used~0_In-2068831924) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-2068831924| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2068831924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2068831924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2068831924, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-2068831924|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2068831924} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:48:53,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In679523373 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In679523373 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In679523373 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In679523373 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out679523373| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out679523373| ~z$w_buff1_used~0_In679523373) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In679523373, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In679523373, ~z$w_buff1_used~0=~z$w_buff1_used~0_In679523373, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In679523373} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In679523373, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In679523373, ~z$w_buff1_used~0=~z$w_buff1_used~0_In679523373, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In679523373, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out679523373|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:48:53,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-206880234 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-206880234 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-206880234| ~z$r_buff0_thd3~0_In-206880234) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-206880234| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-206880234, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-206880234} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-206880234, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-206880234, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-206880234|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:48:53,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1642434580 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1642434580 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1642434580 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1642434580 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1642434580|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1642434580 |P2Thread1of1ForFork0_#t~ite43_Out1642434580|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1642434580, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1642434580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1642434580, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1642434580} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1642434580|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1642434580, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1642434580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1642434580, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1642434580} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:48:53,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:48:53,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 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_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:48:53,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1002204110 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1002204110 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1002204110| |ULTIMATE.start_main_#t~ite48_Out1002204110|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out1002204110| ~z~0_In1002204110)) (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out1002204110| ~z$w_buff1~0_In1002204110)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1002204110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1002204110, ~z$w_buff1~0=~z$w_buff1~0_In1002204110, ~z~0=~z~0_In1002204110} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1002204110, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1002204110|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1002204110, ~z$w_buff1~0=~z$w_buff1~0_In1002204110, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1002204110|, ~z~0=~z~0_In1002204110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:48:53,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In163726515 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In163726515 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out163726515| ~z$w_buff0_used~0_In163726515)) (and (= |ULTIMATE.start_main_#t~ite49_Out163726515| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In163726515, ~z$w_buff0_used~0=~z$w_buff0_used~0_In163726515} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In163726515, ~z$w_buff0_used~0=~z$w_buff0_used~0_In163726515, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out163726515|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:48:53,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In133526074 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In133526074 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In133526074 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In133526074 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out133526074| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out133526074| ~z$w_buff1_used~0_In133526074)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In133526074, ~z$w_buff0_used~0=~z$w_buff0_used~0_In133526074, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In133526074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In133526074} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out133526074|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In133526074, ~z$w_buff0_used~0=~z$w_buff0_used~0_In133526074, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In133526074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In133526074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:48:53,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-761499243 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-761499243 256)))) (or (and (= ~z$r_buff0_thd0~0_In-761499243 |ULTIMATE.start_main_#t~ite51_Out-761499243|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-761499243| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-761499243, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-761499243} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-761499243, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-761499243|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-761499243} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:48:53,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-928782295 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-928782295 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-928782295 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-928782295 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-928782295 |ULTIMATE.start_main_#t~ite52_Out-928782295|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-928782295|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-928782295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-928782295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-928782295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-928782295} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-928782295|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-928782295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-928782295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-928782295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-928782295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:48:53,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, 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, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:48:53,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:48:53 BasicIcfg [2019-12-27 21:48:53,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:48:53,822 INFO L168 Benchmark]: Toolchain (without parser) took 146159.58 ms. Allocated memory was 145.2 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.6 MB in the beginning and 568.4 MB in the end (delta: -466.8 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:48:53,822 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:48:53,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.03 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 156.4 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:48:53,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.34 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:48:53,823 INFO L168 Benchmark]: Boogie Preprocessor took 46.96 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:48:53,824 INFO L168 Benchmark]: RCFGBuilder took 823.41 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 100.7 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:48:53,824 INFO L168 Benchmark]: TraceAbstraction took 144381.15 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.7 MB in the beginning and 568.4 MB in the end (delta: -467.7 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 21:48:53,827 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.03 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 156.4 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.34 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.96 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.41 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 100.7 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144381.15 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.7 MB in the beginning and 568.4 MB in the end (delta: -467.7 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1569, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 144.0s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 55.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8084 SDtfs, 15334 SDslu, 35395 SDs, 0 SdLazy, 25433 SolverSat, 790 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 696 GetRequests, 126 SyntacticMatches, 72 SemanticMatches, 498 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6155 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 47.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 488773 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1543 NumberOfCodeBlocks, 1543 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1446 ConstructedInterpolants, 0 QuantifiedInterpolants, 303168 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...