/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:56:04,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:56:04,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:56:04,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:56:04,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:56:04,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:56:04,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:56:04,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:56:04,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:56:04,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:56:04,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:56:04,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:56:04,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:56:04,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:56:04,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:56:04,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:56:04,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:56:04,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:56:04,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:56:04,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:56:04,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:56:04,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:56:04,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:56:04,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:56:04,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:56:04,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:56:04,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:56:04,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:56:04,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:56:04,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:56:04,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:56:04,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:56:04,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:56:04,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:56:04,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:56:04,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:56:04,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:56:04,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:56:04,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:56:04,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:56:04,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:56:04,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:56:04,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:56:04,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:56:04,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:56:04,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:56:04,661 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:56:04,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:56:04,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:56:04,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:56:04,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:56:04,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:56:04,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:56:04,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:56:04,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:56:04,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:56:04,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:56:04,664 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:56:04,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:56:04,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:56:04,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:56:04,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:56:04,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:56:04,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:56:04,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:56:04,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:56:04,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:56:04,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:56:04,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:56:04,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:56:04,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:56:04,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:56:04,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:56:04,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:56:04,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:56:04,989 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:56:04,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i [2019-12-27 01:56:05,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d4698ea/c972f585c04742cfbae201c11f9a64f9/FLAGec2549ac0 [2019-12-27 01:56:05,612 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:56:05,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i [2019-12-27 01:56:05,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d4698ea/c972f585c04742cfbae201c11f9a64f9/FLAGec2549ac0 [2019-12-27 01:56:05,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d4698ea/c972f585c04742cfbae201c11f9a64f9 [2019-12-27 01:56:05,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:56:05,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:56:05,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:56:05,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:56:05,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:56:05,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:56:05" (1/1) ... [2019-12-27 01:56:05,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b77103d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:05, skipping insertion in model container [2019-12-27 01:56:05,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:56:05" (1/1) ... [2019-12-27 01:56:05,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:56:05,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:56:06,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:56:06,490 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:56:06,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:56:06,641 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:56:06,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06 WrapperNode [2019-12-27 01:56:06,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:56:06,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:56:06,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:56:06,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:56:06,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (1/1) ... [2019-12-27 01:56:06,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (1/1) ... [2019-12-27 01:56:06,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:56:06,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:56:06,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:56:06,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:56:06,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (1/1) ... [2019-12-27 01:56:06,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (1/1) ... [2019-12-27 01:56:06,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (1/1) ... [2019-12-27 01:56:06,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (1/1) ... [2019-12-27 01:56:06,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (1/1) ... [2019-12-27 01:56:06,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (1/1) ... [2019-12-27 01:56:06,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (1/1) ... [2019-12-27 01:56:06,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:56:06,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:56:06,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:56:06,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:56:06,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (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 01:56:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:56:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:56:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:56:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:56:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:56:06,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:56:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:56:06,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:56:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:56:06,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:56:06,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:56:06,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:56:06,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:56:06,849 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 01:56:07,629 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:56:07,629 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:56:07,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:56:07 BoogieIcfgContainer [2019-12-27 01:56:07,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:56:07,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:56:07,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:56:07,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:56:07,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:56:05" (1/3) ... [2019-12-27 01:56:07,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ce93c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:56:07, skipping insertion in model container [2019-12-27 01:56:07,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:06" (2/3) ... [2019-12-27 01:56:07,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ce93c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:56:07, skipping insertion in model container [2019-12-27 01:56:07,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:56:07" (3/3) ... [2019-12-27 01:56:07,639 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_power.opt.i [2019-12-27 01:56:07,649 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:56:07,650 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:56:07,658 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:56:07,659 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:56:07,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,727 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,727 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,734 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,734 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,762 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,764 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,781 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,792 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:07,822 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:56:07,839 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:56:07,839 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:56:07,839 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:56:07,839 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:56:07,839 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:56:07,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:56:07,840 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:56:07,840 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:56:07,859 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 01:56:07,861 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:56:07,996 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:56:07,996 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:56:08,009 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 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:56:08,032 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:56:08,086 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:56:08,087 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:56:08,095 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 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:56:08,116 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:56:08,118 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:56:13,363 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 01:56:13,486 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 01:56:13,739 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 01:56:13,740 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 01:56:13,743 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 01:56:34,889 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 01:56:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 01:56:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:56:34,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:34,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:56:34,896 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 01:56:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:34,901 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 01:56:34,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:34,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134347652] [2019-12-27 01:56:34,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:35,194 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 01:56:35,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134347652] [2019-12-27 01:56:35,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:35,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:56:35,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725442578] [2019-12-27 01:56:35,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:35,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:35,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:35,221 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 01:56:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:36,861 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 01:56:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:36,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:56:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:37,550 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 01:56:37,550 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 01:56:37,552 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 01:56:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 01:56:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 01:56:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 01:56:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 01:56:53,561 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 01:56:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:53,562 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 01:56:53,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 01:56:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:56:53,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:53,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:53,568 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 01:56:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 01:56:53,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:53,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539753808] [2019-12-27 01:56:53,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:53,668 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 01:56:53,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539753808] [2019-12-27 01:56:53,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:53,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:53,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861948946] [2019-12-27 01:56:53,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:56:53,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:53,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:56:53,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:53,673 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 01:56:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:55,090 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 01:56:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:56:55,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:56:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:55,692 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 01:56:55,692 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 01:56:55,693 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 01:57:05,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 01:57:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 01:57:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 01:57:09,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 01:57:09,300 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 01:57:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:09,300 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 01:57:09,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:57:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 01:57:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:57:09,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:09,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:09,309 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 01:57:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 01:57:09,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:09,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940761558] [2019-12-27 01:57:09,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:09,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940761558] [2019-12-27 01:57:09,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:09,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:09,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765732130] [2019-12-27 01:57:09,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:09,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:09,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:09,415 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 01:57:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:09,597 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 01:57:09,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:09,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:57:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:09,686 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 01:57:09,687 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 01:57:09,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 01:57:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 01:57:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 01:57:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 01:57:15,173 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 01:57:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:15,173 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 01:57:15,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 01:57:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:57:15,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:15,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:15,176 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 01:57:15,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:15,176 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 01:57:15,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:15,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882340319] [2019-12-27 01:57:15,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:15,223 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 01:57:15,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882340319] [2019-12-27 01:57:15,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:15,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:15,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690270229] [2019-12-27 01:57:15,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:15,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:15,227 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 01:57:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:15,436 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 01:57:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:15,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:57:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:15,557 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 01:57:15,558 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 01:57:15,558 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 01:57:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 01:57:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 01:57:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 01:57:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 01:57:16,416 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 01:57:16,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:16,417 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 01:57:16,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 01:57:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:57:16,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:16,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:16,421 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 01:57:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 01:57:16,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:16,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661290946] [2019-12-27 01:57:16,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:16,481 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 01:57:16,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661290946] [2019-12-27 01:57:16,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:16,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:16,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562077549] [2019-12-27 01:57:16,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:57:16,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:16,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:57:16,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:57:16,483 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 01:57:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:16,900 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 01:57:16,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:57:16,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:57:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:16,999 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 01:57:17,000 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 01:57:17,000 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 01:57:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 01:57:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 01:57:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 01:57:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 01:57:18,269 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 01:57:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:18,269 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 01:57:18,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:57:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 01:57:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:57:18,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:18,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:18,273 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 01:57:18,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 01:57:18,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:18,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884657831] [2019-12-27 01:57:18,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:18,367 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 01:57:18,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884657831] [2019-12-27 01:57:18,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:18,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:18,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796016521] [2019-12-27 01:57:18,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:57:18,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:18,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:57:18,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:57:18,370 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 01:57:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:18,724 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 01:57:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:57:18,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:57:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:18,818 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 01:57:18,819 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 01:57:18,819 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 01:57:19,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 01:57:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 01:57:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 01:57:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 01:57:19,640 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 01:57:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:19,640 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 01:57:19,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:57:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 01:57:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:57:19,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:19,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:19,650 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 01:57:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 01:57:19,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:19,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560356423] [2019-12-27 01:57:19,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:19,730 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 01:57:19,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560356423] [2019-12-27 01:57:19,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:19,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:19,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608442868] [2019-12-27 01:57:19,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:19,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:19,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:19,732 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 01:57:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:20,749 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 01:57:20,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:57:20,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:57:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:20,858 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 01:57:20,858 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 01:57:20,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:57:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 01:57:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 01:57:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 01:57:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 01:57:21,758 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 01:57:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:21,758 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 01:57:21,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 01:57:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:57:21,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:21,766 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 01:57:21,766 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 01:57:21,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 01:57:21,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:21,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901906715] [2019-12-27 01:57:21,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:21,845 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 01:57:21,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901906715] [2019-12-27 01:57:21,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:21,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:21,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574936505] [2019-12-27 01:57:21,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:21,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:21,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:21,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:21,847 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 01:57:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:22,496 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 01:57:22,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:57:22,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:57:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:22,599 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 01:57:22,599 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 01:57:22,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:57:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 01:57:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 01:57:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 01:57:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 01:57:23,959 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 01:57:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:23,959 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 01:57:23,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 01:57:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:57:23,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:23,971 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 01:57:23,971 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 01:57:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 01:57:23,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:23,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516673093] [2019-12-27 01:57:23,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:24,019 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 01:57:24,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516673093] [2019-12-27 01:57:24,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:24,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:24,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117865628] [2019-12-27 01:57:24,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:57:24,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:24,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:57:24,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:57:24,022 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-27 01:57:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:24,103 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 01:57:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:57:24,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:57:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:24,126 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 01:57:24,126 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 01:57:24,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:57:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 01:57:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 01:57:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 01:57:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 01:57:24,369 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 01:57:24,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:24,371 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 01:57:24,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:57:24,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 01:57:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:57:24,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:24,383 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] [2019-12-27 01:57:24,383 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 01:57:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:24,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 01:57:24,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:24,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704745227] [2019-12-27 01:57:24,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:24,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704745227] [2019-12-27 01:57:24,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:24,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:24,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024166691] [2019-12-27 01:57:24,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:24,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:24,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:24,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:24,479 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 01:57:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:24,876 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 01:57:24,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:57:24,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 01:57:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:24,921 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 01:57:24,921 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 01:57:24,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 01:57:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 01:57:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 01:57:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 01:57:25,250 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 01:57:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:25,250 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 01:57:25,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 01:57:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:57:25,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:25,265 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] [2019-12-27 01:57:25,265 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 01:57:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 01:57:25,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:25,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896224904] [2019-12-27 01:57:25,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:25,332 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 01:57:25,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896224904] [2019-12-27 01:57:25,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:25,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:25,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257375091] [2019-12-27 01:57:25,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:25,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:25,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:25,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:25,334 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 01:57:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:25,679 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 01:57:25,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:57:25,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:57:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:25,711 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 01:57:25,711 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 01:57:25,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 01:57:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 01:57:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 01:57:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 01:57:26,020 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 01:57:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:26,020 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 01:57:26,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 01:57:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 01:57:26,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:26,308 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] [2019-12-27 01:57:26,308 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 01:57:26,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:26,308 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 01:57:26,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:26,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762858753] [2019-12-27 01:57:26,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:26,483 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 01:57:26,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762858753] [2019-12-27 01:57:26,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:26,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:57:26,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987082224] [2019-12-27 01:57:26,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:26,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:26,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:26,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:26,486 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 7 states. [2019-12-27 01:57:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:27,239 INFO L93 Difference]: Finished difference Result 28860 states and 86218 transitions. [2019-12-27 01:57:27,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:57:27,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 01:57:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:27,291 INFO L225 Difference]: With dead ends: 28860 [2019-12-27 01:57:27,291 INFO L226 Difference]: Without dead ends: 28860 [2019-12-27 01:57:27,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:57:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28860 states. [2019-12-27 01:57:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28860 to 21822. [2019-12-27 01:57:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21822 states. [2019-12-27 01:57:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21822 states to 21822 states and 66391 transitions. [2019-12-27 01:57:27,637 INFO L78 Accepts]: Start accepts. Automaton has 21822 states and 66391 transitions. Word has length 32 [2019-12-27 01:57:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:27,637 INFO L462 AbstractCegarLoop]: Abstraction has 21822 states and 66391 transitions. [2019-12-27 01:57:27,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 21822 states and 66391 transitions. [2019-12-27 01:57:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:57:27,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:27,660 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] [2019-12-27 01:57:27,660 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 01:57:27,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:27,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 01:57:27,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:27,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834333467] [2019-12-27 01:57:27,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:27,757 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 01:57:27,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834333467] [2019-12-27 01:57:27,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:27,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:57:27,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370934021] [2019-12-27 01:57:27,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:57:27,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:57:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:27,759 INFO L87 Difference]: Start difference. First operand 21822 states and 66391 transitions. Second operand 6 states. [2019-12-27 01:57:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:28,507 INFO L93 Difference]: Finished difference Result 29045 states and 86925 transitions. [2019-12-27 01:57:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:57:28,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 01:57:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:28,554 INFO L225 Difference]: With dead ends: 29045 [2019-12-27 01:57:28,554 INFO L226 Difference]: Without dead ends: 29045 [2019-12-27 01:57:28,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:57:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29045 states. [2019-12-27 01:57:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29045 to 21326. [2019-12-27 01:57:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21326 states. [2019-12-27 01:57:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21326 states to 21326 states and 65148 transitions. [2019-12-27 01:57:28,911 INFO L78 Accepts]: Start accepts. Automaton has 21326 states and 65148 transitions. Word has length 34 [2019-12-27 01:57:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:28,912 INFO L462 AbstractCegarLoop]: Abstraction has 21326 states and 65148 transitions. [2019-12-27 01:57:28,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:57:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 21326 states and 65148 transitions. [2019-12-27 01:57:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 01:57:28,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:28,931 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] [2019-12-27 01:57:28,931 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 01:57:28,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash -294288994, now seen corresponding path program 1 times [2019-12-27 01:57:28,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:28,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18995292] [2019-12-27 01:57:28,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:29,034 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 01:57:29,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18995292] [2019-12-27 01:57:29,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:29,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:57:29,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846876393] [2019-12-27 01:57:29,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:29,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:29,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:29,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:29,036 INFO L87 Difference]: Start difference. First operand 21326 states and 65148 transitions. Second operand 7 states. [2019-12-27 01:57:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:29,688 INFO L93 Difference]: Finished difference Result 26935 states and 80586 transitions. [2019-12-27 01:57:29,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:57:29,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-12-27 01:57:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:29,726 INFO L225 Difference]: With dead ends: 26935 [2019-12-27 01:57:29,726 INFO L226 Difference]: Without dead ends: 26935 [2019-12-27 01:57:29,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:57:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26935 states. [2019-12-27 01:57:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26935 to 17844. [2019-12-27 01:57:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17844 states. [2019-12-27 01:57:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17844 states to 17844 states and 54566 transitions. [2019-12-27 01:57:30,031 INFO L78 Accepts]: Start accepts. Automaton has 17844 states and 54566 transitions. Word has length 36 [2019-12-27 01:57:30,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:30,031 INFO L462 AbstractCegarLoop]: Abstraction has 17844 states and 54566 transitions. [2019-12-27 01:57:30,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 17844 states and 54566 transitions. [2019-12-27 01:57:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:57:30,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:30,049 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 01:57:30,049 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 01:57:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 01:57:30,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:30,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311703768] [2019-12-27 01:57:30,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:30,096 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 01:57:30,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311703768] [2019-12-27 01:57:30,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:30,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:57:30,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781714991] [2019-12-27 01:57:30,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:30,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:30,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:30,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:30,098 INFO L87 Difference]: Start difference. First operand 17844 states and 54566 transitions. Second operand 3 states. [2019-12-27 01:57:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:30,394 INFO L93 Difference]: Finished difference Result 17843 states and 54564 transitions. [2019-12-27 01:57:30,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:30,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:57:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:30,431 INFO L225 Difference]: With dead ends: 17843 [2019-12-27 01:57:30,432 INFO L226 Difference]: Without dead ends: 17843 [2019-12-27 01:57:30,434 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 01:57:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17843 states. [2019-12-27 01:57:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17843 to 17843. [2019-12-27 01:57:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17843 states. [2019-12-27 01:57:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17843 states to 17843 states and 54564 transitions. [2019-12-27 01:57:30,788 INFO L78 Accepts]: Start accepts. Automaton has 17843 states and 54564 transitions. Word has length 39 [2019-12-27 01:57:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:30,788 INFO L462 AbstractCegarLoop]: Abstraction has 17843 states and 54564 transitions. [2019-12-27 01:57:30,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17843 states and 54564 transitions. [2019-12-27 01:57:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:57:30,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:30,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:30,810 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 01:57:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 01:57:30,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:30,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627860662] [2019-12-27 01:57:30,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:30,880 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 01:57:30,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627860662] [2019-12-27 01:57:30,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:30,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:57:30,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870671138] [2019-12-27 01:57:30,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:30,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:30,882 INFO L87 Difference]: Start difference. First operand 17843 states and 54564 transitions. Second operand 5 states. [2019-12-27 01:57:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:31,450 INFO L93 Difference]: Finished difference Result 25586 states and 77360 transitions. [2019-12-27 01:57:31,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:57:31,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:57:31,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:31,486 INFO L225 Difference]: With dead ends: 25586 [2019-12-27 01:57:31,486 INFO L226 Difference]: Without dead ends: 25586 [2019-12-27 01:57:31,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25586 states. [2019-12-27 01:57:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25586 to 23742. [2019-12-27 01:57:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23742 states. [2019-12-27 01:57:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23742 states to 23742 states and 72302 transitions. [2019-12-27 01:57:31,828 INFO L78 Accepts]: Start accepts. Automaton has 23742 states and 72302 transitions. Word has length 40 [2019-12-27 01:57:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:31,828 INFO L462 AbstractCegarLoop]: Abstraction has 23742 states and 72302 transitions. [2019-12-27 01:57:31,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 23742 states and 72302 transitions. [2019-12-27 01:57:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:57:31,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:31,856 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 01:57:31,856 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 01:57:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 01:57:31,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:31,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613466113] [2019-12-27 01:57:31,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:31,913 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 01:57:31,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613466113] [2019-12-27 01:57:31,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:31,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:57:31,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87118286] [2019-12-27 01:57:31,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:31,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:31,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:31,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:31,915 INFO L87 Difference]: Start difference. First operand 23742 states and 72302 transitions. Second operand 5 states. [2019-12-27 01:57:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:32,010 INFO L93 Difference]: Finished difference Result 22357 states and 69069 transitions. [2019-12-27 01:57:32,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:57:32,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:57:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:32,041 INFO L225 Difference]: With dead ends: 22357 [2019-12-27 01:57:32,042 INFO L226 Difference]: Without dead ends: 22357 [2019-12-27 01:57:32,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22357 states. [2019-12-27 01:57:32,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22357 to 21433. [2019-12-27 01:57:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21433 states. [2019-12-27 01:57:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21433 states to 21433 states and 66576 transitions. [2019-12-27 01:57:32,356 INFO L78 Accepts]: Start accepts. Automaton has 21433 states and 66576 transitions. Word has length 40 [2019-12-27 01:57:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:32,356 INFO L462 AbstractCegarLoop]: Abstraction has 21433 states and 66576 transitions. [2019-12-27 01:57:32,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 21433 states and 66576 transitions. [2019-12-27 01:57:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:32,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:32,377 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] [2019-12-27 01:57:32,377 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 01:57:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 01:57:32,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:32,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411406784] [2019-12-27 01:57:32,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:32,469 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 01:57:32,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411406784] [2019-12-27 01:57:32,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:32,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:32,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638850165] [2019-12-27 01:57:32,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:32,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:32,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:32,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:32,471 INFO L87 Difference]: Start difference. First operand 21433 states and 66576 transitions. Second operand 7 states. [2019-12-27 01:57:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:33,087 INFO L93 Difference]: Finished difference Result 61846 states and 190827 transitions. [2019-12-27 01:57:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:57:33,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:57:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:33,166 INFO L225 Difference]: With dead ends: 61846 [2019-12-27 01:57:33,166 INFO L226 Difference]: Without dead ends: 47493 [2019-12-27 01:57:33,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:57:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47493 states. [2019-12-27 01:57:34,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47493 to 24866. [2019-12-27 01:57:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24866 states. [2019-12-27 01:57:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24866 states to 24866 states and 77717 transitions. [2019-12-27 01:57:34,096 INFO L78 Accepts]: Start accepts. Automaton has 24866 states and 77717 transitions. Word has length 63 [2019-12-27 01:57:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:34,097 INFO L462 AbstractCegarLoop]: Abstraction has 24866 states and 77717 transitions. [2019-12-27 01:57:34,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 24866 states and 77717 transitions. [2019-12-27 01:57:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:34,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:34,124 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] [2019-12-27 01:57:34,125 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 01:57:34,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 01:57:34,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:34,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918813764] [2019-12-27 01:57:34,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:34,202 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 01:57:34,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918813764] [2019-12-27 01:57:34,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:34,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:34,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195365555] [2019-12-27 01:57:34,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:34,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:34,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:34,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:34,204 INFO L87 Difference]: Start difference. First operand 24866 states and 77717 transitions. Second operand 7 states. [2019-12-27 01:57:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:34,737 INFO L93 Difference]: Finished difference Result 68350 states and 209846 transitions. [2019-12-27 01:57:34,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:57:34,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:57:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:34,836 INFO L225 Difference]: With dead ends: 68350 [2019-12-27 01:57:34,836 INFO L226 Difference]: Without dead ends: 48467 [2019-12-27 01:57:34,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:57:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48467 states. [2019-12-27 01:57:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48467 to 28731. [2019-12-27 01:57:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28731 states. [2019-12-27 01:57:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28731 states to 28731 states and 89455 transitions. [2019-12-27 01:57:35,427 INFO L78 Accepts]: Start accepts. Automaton has 28731 states and 89455 transitions. Word has length 63 [2019-12-27 01:57:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:35,428 INFO L462 AbstractCegarLoop]: Abstraction has 28731 states and 89455 transitions. [2019-12-27 01:57:35,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 28731 states and 89455 transitions. [2019-12-27 01:57:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:35,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:35,460 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] [2019-12-27 01:57:35,460 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 01:57:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 01:57:35,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:35,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651082413] [2019-12-27 01:57:35,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:35,539 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 01:57:35,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651082413] [2019-12-27 01:57:35,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:35,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:35,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103119776] [2019-12-27 01:57:35,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:35,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:35,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:35,541 INFO L87 Difference]: Start difference. First operand 28731 states and 89455 transitions. Second operand 7 states. [2019-12-27 01:57:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:36,122 INFO L93 Difference]: Finished difference Result 59776 states and 183509 transitions. [2019-12-27 01:57:36,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:57:36,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:57:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:36,230 INFO L225 Difference]: With dead ends: 59776 [2019-12-27 01:57:36,230 INFO L226 Difference]: Without dead ends: 52695 [2019-12-27 01:57:36,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:57:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52695 states. [2019-12-27 01:57:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52695 to 29039. [2019-12-27 01:57:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29039 states. [2019-12-27 01:57:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29039 states to 29039 states and 90406 transitions. [2019-12-27 01:57:36,847 INFO L78 Accepts]: Start accepts. Automaton has 29039 states and 90406 transitions. Word has length 63 [2019-12-27 01:57:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:36,848 INFO L462 AbstractCegarLoop]: Abstraction has 29039 states and 90406 transitions. [2019-12-27 01:57:36,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29039 states and 90406 transitions. [2019-12-27 01:57:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:36,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:36,880 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] [2019-12-27 01:57:36,880 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 01:57:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 01:57:36,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:36,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29969765] [2019-12-27 01:57:36,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:37,341 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 01:57:37,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29969765] [2019-12-27 01:57:37,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:37,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:57:37,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535322867] [2019-12-27 01:57:37,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:37,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:37,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:37,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:37,343 INFO L87 Difference]: Start difference. First operand 29039 states and 90406 transitions. Second operand 7 states. [2019-12-27 01:57:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:38,725 INFO L93 Difference]: Finished difference Result 38027 states and 116042 transitions. [2019-12-27 01:57:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:57:38,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:57:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:38,811 INFO L225 Difference]: With dead ends: 38027 [2019-12-27 01:57:38,812 INFO L226 Difference]: Without dead ends: 37803 [2019-12-27 01:57:38,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:57:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37803 states. [2019-12-27 01:57:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37803 to 31827. [2019-12-27 01:57:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31827 states. [2019-12-27 01:57:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31827 states to 31827 states and 98705 transitions. [2019-12-27 01:57:39,550 INFO L78 Accepts]: Start accepts. Automaton has 31827 states and 98705 transitions. Word has length 63 [2019-12-27 01:57:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:39,550 INFO L462 AbstractCegarLoop]: Abstraction has 31827 states and 98705 transitions. [2019-12-27 01:57:39,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 31827 states and 98705 transitions. [2019-12-27 01:57:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:39,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:39,594 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] [2019-12-27 01:57:39,594 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 01:57:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:39,594 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-27 01:57:39,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:39,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851960304] [2019-12-27 01:57:39,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:39,706 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 01:57:39,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851960304] [2019-12-27 01:57:39,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:39,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:57:39,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684083310] [2019-12-27 01:57:39,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:57:39,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:39,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:57:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:39,710 INFO L87 Difference]: Start difference. First operand 31827 states and 98705 transitions. Second operand 8 states. [2019-12-27 01:57:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:41,491 INFO L93 Difference]: Finished difference Result 56374 states and 170009 transitions. [2019-12-27 01:57:41,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:57:41,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:57:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:41,577 INFO L225 Difference]: With dead ends: 56374 [2019-12-27 01:57:41,578 INFO L226 Difference]: Without dead ends: 56099 [2019-12-27 01:57:41,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:57:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56099 states. [2019-12-27 01:57:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56099 to 36100. [2019-12-27 01:57:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36100 states. [2019-12-27 01:57:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36100 states to 36100 states and 111499 transitions. [2019-12-27 01:57:42,301 INFO L78 Accepts]: Start accepts. Automaton has 36100 states and 111499 transitions. Word has length 63 [2019-12-27 01:57:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:42,302 INFO L462 AbstractCegarLoop]: Abstraction has 36100 states and 111499 transitions. [2019-12-27 01:57:42,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:57:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 36100 states and 111499 transitions. [2019-12-27 01:57:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:42,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:42,344 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] [2019-12-27 01:57:42,344 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 01:57:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-27 01:57:42,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:42,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735744178] [2019-12-27 01:57:42,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:42,437 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 01:57:42,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735744178] [2019-12-27 01:57:42,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:42,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:42,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57295375] [2019-12-27 01:57:42,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:57:42,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:42,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:57:42,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:42,439 INFO L87 Difference]: Start difference. First operand 36100 states and 111499 transitions. Second operand 6 states. [2019-12-27 01:57:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:43,567 INFO L93 Difference]: Finished difference Result 59338 states and 180879 transitions. [2019-12-27 01:57:43,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:57:43,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-27 01:57:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:43,658 INFO L225 Difference]: With dead ends: 59338 [2019-12-27 01:57:43,659 INFO L226 Difference]: Without dead ends: 59118 [2019-12-27 01:57:43,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:57:43,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59118 states. [2019-12-27 01:57:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59118 to 40445. [2019-12-27 01:57:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40445 states. [2019-12-27 01:57:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40445 states to 40445 states and 124847 transitions. [2019-12-27 01:57:44,432 INFO L78 Accepts]: Start accepts. Automaton has 40445 states and 124847 transitions. Word has length 63 [2019-12-27 01:57:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:44,432 INFO L462 AbstractCegarLoop]: Abstraction has 40445 states and 124847 transitions. [2019-12-27 01:57:44,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:57:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 40445 states and 124847 transitions. [2019-12-27 01:57:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:44,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:44,478 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] [2019-12-27 01:57:44,478 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 01:57:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:44,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-27 01:57:44,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:44,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233386575] [2019-12-27 01:57:44,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:44,600 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 01:57:44,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233386575] [2019-12-27 01:57:44,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:44,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:57:44,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267668401] [2019-12-27 01:57:44,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:44,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:44,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:44,603 INFO L87 Difference]: Start difference. First operand 40445 states and 124847 transitions. Second operand 7 states. [2019-12-27 01:57:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:45,720 INFO L93 Difference]: Finished difference Result 60721 states and 184739 transitions. [2019-12-27 01:57:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:57:45,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:57:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:45,816 INFO L225 Difference]: With dead ends: 60721 [2019-12-27 01:57:45,816 INFO L226 Difference]: Without dead ends: 60469 [2019-12-27 01:57:45,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:57:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60469 states. [2019-12-27 01:57:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60469 to 41347. [2019-12-27 01:57:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41347 states. [2019-12-27 01:57:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41347 states to 41347 states and 127484 transitions. [2019-12-27 01:57:47,244 INFO L78 Accepts]: Start accepts. Automaton has 41347 states and 127484 transitions. Word has length 63 [2019-12-27 01:57:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:47,245 INFO L462 AbstractCegarLoop]: Abstraction has 41347 states and 127484 transitions. [2019-12-27 01:57:47,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 41347 states and 127484 transitions. [2019-12-27 01:57:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:47,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:47,292 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] [2019-12-27 01:57:47,292 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 01:57:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-27 01:57:47,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:47,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251969703] [2019-12-27 01:57:47,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:47,457 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 01:57:47,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251969703] [2019-12-27 01:57:47,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:47,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 01:57:47,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929987714] [2019-12-27 01:57:47,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:57:47,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:47,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:57:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:57:47,459 INFO L87 Difference]: Start difference. First operand 41347 states and 127484 transitions. Second operand 11 states. [2019-12-27 01:57:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:50,269 INFO L93 Difference]: Finished difference Result 63332 states and 190912 transitions. [2019-12-27 01:57:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 01:57:50,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-12-27 01:57:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:50,368 INFO L225 Difference]: With dead ends: 63332 [2019-12-27 01:57:50,368 INFO L226 Difference]: Without dead ends: 63332 [2019-12-27 01:57:50,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2019-12-27 01:57:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63332 states. [2019-12-27 01:57:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63332 to 40631. [2019-12-27 01:57:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40631 states. [2019-12-27 01:57:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40631 states to 40631 states and 125369 transitions. [2019-12-27 01:57:51,174 INFO L78 Accepts]: Start accepts. Automaton has 40631 states and 125369 transitions. Word has length 63 [2019-12-27 01:57:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:51,174 INFO L462 AbstractCegarLoop]: Abstraction has 40631 states and 125369 transitions. [2019-12-27 01:57:51,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:57:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 40631 states and 125369 transitions. [2019-12-27 01:57:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:51,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:51,218 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] [2019-12-27 01:57:51,218 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 01:57:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash 194134925, now seen corresponding path program 9 times [2019-12-27 01:57:51,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:51,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022167175] [2019-12-27 01:57:51,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:51,345 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 01:57:51,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022167175] [2019-12-27 01:57:51,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:51,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:57:51,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479751431] [2019-12-27 01:57:51,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:57:51,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:51,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:57:51,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:51,348 INFO L87 Difference]: Start difference. First operand 40631 states and 125369 transitions. Second operand 8 states. [2019-12-27 01:57:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:52,321 INFO L93 Difference]: Finished difference Result 56394 states and 172120 transitions. [2019-12-27 01:57:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:57:52,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:57:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:52,406 INFO L225 Difference]: With dead ends: 56394 [2019-12-27 01:57:52,407 INFO L226 Difference]: Without dead ends: 56394 [2019-12-27 01:57:52,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:57:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56394 states. [2019-12-27 01:57:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56394 to 39997. [2019-12-27 01:57:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39997 states. [2019-12-27 01:57:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39997 states to 39997 states and 123438 transitions. [2019-12-27 01:57:53,524 INFO L78 Accepts]: Start accepts. Automaton has 39997 states and 123438 transitions. Word has length 63 [2019-12-27 01:57:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:53,524 INFO L462 AbstractCegarLoop]: Abstraction has 39997 states and 123438 transitions. [2019-12-27 01:57:53,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:57:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 39997 states and 123438 transitions. [2019-12-27 01:57:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:53,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:53,568 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] [2019-12-27 01:57:53,568 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 01:57:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:53,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1930988027, now seen corresponding path program 10 times [2019-12-27 01:57:53,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:53,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920896288] [2019-12-27 01:57:53,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:53,673 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 01:57:53,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920896288] [2019-12-27 01:57:53,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:53,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:57:53,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085558302] [2019-12-27 01:57:53,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:57:53,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:53,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:57:53,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:53,675 INFO L87 Difference]: Start difference. First operand 39997 states and 123438 transitions. Second operand 8 states. [2019-12-27 01:57:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:54,921 INFO L93 Difference]: Finished difference Result 57242 states and 174720 transitions. [2019-12-27 01:57:54,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:57:54,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:57:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:55,015 INFO L225 Difference]: With dead ends: 57242 [2019-12-27 01:57:55,016 INFO L226 Difference]: Without dead ends: 57242 [2019-12-27 01:57:55,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:57:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57242 states. [2019-12-27 01:57:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57242 to 37736. [2019-12-27 01:57:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37736 states. [2019-12-27 01:57:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37736 states to 37736 states and 116693 transitions. [2019-12-27 01:57:55,730 INFO L78 Accepts]: Start accepts. Automaton has 37736 states and 116693 transitions. Word has length 63 [2019-12-27 01:57:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:55,730 INFO L462 AbstractCegarLoop]: Abstraction has 37736 states and 116693 transitions. [2019-12-27 01:57:55,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:57:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 37736 states and 116693 transitions. [2019-12-27 01:57:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:55,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:55,772 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] [2019-12-27 01:57:55,772 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 01:57:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1638823163, now seen corresponding path program 11 times [2019-12-27 01:57:55,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:55,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717358439] [2019-12-27 01:57:55,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:55,865 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 01:57:55,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717358439] [2019-12-27 01:57:55,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:55,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:55,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661525702] [2019-12-27 01:57:55,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:57:55,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:55,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:57:55,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:55,867 INFO L87 Difference]: Start difference. First operand 37736 states and 116693 transitions. Second operand 6 states. [2019-12-27 01:57:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:56,702 INFO L93 Difference]: Finished difference Result 59019 states and 179806 transitions. [2019-12-27 01:57:56,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:57:56,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-27 01:57:56,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:56,793 INFO L225 Difference]: With dead ends: 59019 [2019-12-27 01:57:56,793 INFO L226 Difference]: Without dead ends: 59019 [2019-12-27 01:57:56,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:57:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59019 states. [2019-12-27 01:57:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59019 to 39698. [2019-12-27 01:57:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39698 states. [2019-12-27 01:57:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39698 states to 39698 states and 122710 transitions. [2019-12-27 01:57:57,914 INFO L78 Accepts]: Start accepts. Automaton has 39698 states and 122710 transitions. Word has length 63 [2019-12-27 01:57:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:57,914 INFO L462 AbstractCegarLoop]: Abstraction has 39698 states and 122710 transitions. [2019-12-27 01:57:57,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:57:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 39698 states and 122710 transitions. [2019-12-27 01:57:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:57,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:57,961 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] [2019-12-27 01:57:57,962 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 01:57:57,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:57,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1952090881, now seen corresponding path program 12 times [2019-12-27 01:57:57,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:57,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055540084] [2019-12-27 01:57:57,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:58,090 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 01:57:58,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055540084] [2019-12-27 01:57:58,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:58,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:57:58,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786131781] [2019-12-27 01:57:58,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:57:58,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:58,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:57:58,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:58,092 INFO L87 Difference]: Start difference. First operand 39698 states and 122710 transitions. Second operand 8 states. [2019-12-27 01:57:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:59,100 INFO L93 Difference]: Finished difference Result 58516 states and 178386 transitions. [2019-12-27 01:57:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:57:59,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:57:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:59,189 INFO L225 Difference]: With dead ends: 58516 [2019-12-27 01:57:59,189 INFO L226 Difference]: Without dead ends: 58516 [2019-12-27 01:57:59,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:57:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58516 states. [2019-12-27 01:57:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58516 to 38275. [2019-12-27 01:57:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38275 states. [2019-12-27 01:57:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38275 states to 38275 states and 118434 transitions. [2019-12-27 01:57:59,924 INFO L78 Accepts]: Start accepts. Automaton has 38275 states and 118434 transitions. Word has length 63 [2019-12-27 01:57:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:59,925 INFO L462 AbstractCegarLoop]: Abstraction has 38275 states and 118434 transitions. [2019-12-27 01:57:59,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:57:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 38275 states and 118434 transitions. [2019-12-27 01:57:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:59,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:59,968 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] [2019-12-27 01:57:59,968 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 01:57:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1981956519, now seen corresponding path program 13 times [2019-12-27 01:57:59,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:59,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214800687] [2019-12-27 01:57:59,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:00,064 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 01:58:00,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214800687] [2019-12-27 01:58:00,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:00,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:58:00,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952453096] [2019-12-27 01:58:00,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:58:00,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:00,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:58:00,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:58:00,066 INFO L87 Difference]: Start difference. First operand 38275 states and 118434 transitions. Second operand 8 states. [2019-12-27 01:58:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:01,886 INFO L93 Difference]: Finished difference Result 62331 states and 187930 transitions. [2019-12-27 01:58:01,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:58:01,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:58:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:01,982 INFO L225 Difference]: With dead ends: 62331 [2019-12-27 01:58:01,982 INFO L226 Difference]: Without dead ends: 62331 [2019-12-27 01:58:01,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:58:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62331 states. [2019-12-27 01:58:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62331 to 38659. [2019-12-27 01:58:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38659 states. [2019-12-27 01:58:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38659 states to 38659 states and 119774 transitions. [2019-12-27 01:58:03,136 INFO L78 Accepts]: Start accepts. Automaton has 38659 states and 119774 transitions. Word has length 63 [2019-12-27 01:58:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:03,136 INFO L462 AbstractCegarLoop]: Abstraction has 38659 states and 119774 transitions. [2019-12-27 01:58:03,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:58:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 38659 states and 119774 transitions. [2019-12-27 01:58:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:03,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:03,180 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] [2019-12-27 01:58:03,181 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 01:58:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1745238685, now seen corresponding path program 14 times [2019-12-27 01:58:03,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:03,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218069110] [2019-12-27 01:58:03,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:03,298 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 01:58:03,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218069110] [2019-12-27 01:58:03,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:03,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:58:03,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008975512] [2019-12-27 01:58:03,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:58:03,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:58:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:58:03,300 INFO L87 Difference]: Start difference. First operand 38659 states and 119774 transitions. Second operand 8 states. [2019-12-27 01:58:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:04,345 INFO L93 Difference]: Finished difference Result 52711 states and 161290 transitions. [2019-12-27 01:58:04,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:58:04,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:58:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:04,425 INFO L225 Difference]: With dead ends: 52711 [2019-12-27 01:58:04,425 INFO L226 Difference]: Without dead ends: 52655 [2019-12-27 01:58:04,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:58:04,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52655 states. [2019-12-27 01:58:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52655 to 37911. [2019-12-27 01:58:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37911 states. [2019-12-27 01:58:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37911 states to 37911 states and 116714 transitions. [2019-12-27 01:58:05,126 INFO L78 Accepts]: Start accepts. Automaton has 37911 states and 116714 transitions. Word has length 63 [2019-12-27 01:58:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:05,126 INFO L462 AbstractCegarLoop]: Abstraction has 37911 states and 116714 transitions. [2019-12-27 01:58:05,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:58:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 37911 states and 116714 transitions. [2019-12-27 01:58:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:05,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:05,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:05,172 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1876409601, now seen corresponding path program 15 times [2019-12-27 01:58:05,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:05,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86649016] [2019-12-27 01:58:05,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:05,340 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 01:58:05,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86649016] [2019-12-27 01:58:05,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:05,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 01:58:05,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342656775] [2019-12-27 01:58:05,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:58:05,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:05,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:58:05,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:58:05,343 INFO L87 Difference]: Start difference. First operand 37911 states and 116714 transitions. Second operand 12 states. [2019-12-27 01:58:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:06,945 INFO L93 Difference]: Finished difference Result 51608 states and 157762 transitions. [2019-12-27 01:58:06,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:58:06,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-27 01:58:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:07,024 INFO L225 Difference]: With dead ends: 51608 [2019-12-27 01:58:07,024 INFO L226 Difference]: Without dead ends: 51608 [2019-12-27 01:58:07,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:58:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51608 states. [2019-12-27 01:58:07,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51608 to 36435. [2019-12-27 01:58:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36435 states. [2019-12-27 01:58:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36435 states to 36435 states and 112105 transitions. [2019-12-27 01:58:08,064 INFO L78 Accepts]: Start accepts. Automaton has 36435 states and 112105 transitions. Word has length 63 [2019-12-27 01:58:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:08,064 INFO L462 AbstractCegarLoop]: Abstraction has 36435 states and 112105 transitions. [2019-12-27 01:58:08,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:58:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 36435 states and 112105 transitions. [2019-12-27 01:58:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:08,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:08,110 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] [2019-12-27 01:58:08,110 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:08,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1937295543, now seen corresponding path program 16 times [2019-12-27 01:58:08,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:08,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910318938] [2019-12-27 01:58:08,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:08,211 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 01:58:08,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910318938] [2019-12-27 01:58:08,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:08,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:58:08,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869132207] [2019-12-27 01:58:08,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:58:08,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:08,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:58:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:08,213 INFO L87 Difference]: Start difference. First operand 36435 states and 112105 transitions. Second operand 7 states. [2019-12-27 01:58:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:09,289 INFO L93 Difference]: Finished difference Result 56530 states and 171414 transitions. [2019-12-27 01:58:09,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:58:09,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:58:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:09,375 INFO L225 Difference]: With dead ends: 56530 [2019-12-27 01:58:09,375 INFO L226 Difference]: Without dead ends: 56530 [2019-12-27 01:58:09,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:58:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56530 states. [2019-12-27 01:58:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56530 to 37875. [2019-12-27 01:58:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37875 states. [2019-12-27 01:58:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37875 states to 37875 states and 116271 transitions. [2019-12-27 01:58:10,084 INFO L78 Accepts]: Start accepts. Automaton has 37875 states and 116271 transitions. Word has length 63 [2019-12-27 01:58:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:10,085 INFO L462 AbstractCegarLoop]: Abstraction has 37875 states and 116271 transitions. [2019-12-27 01:58:10,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:58:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37875 states and 116271 transitions. [2019-12-27 01:58:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:10,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:10,129 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] [2019-12-27 01:58:10,129 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1351537083, now seen corresponding path program 17 times [2019-12-27 01:58:10,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:10,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540988916] [2019-12-27 01:58:10,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:10,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540988916] [2019-12-27 01:58:10,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:10,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:58:10,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661573378] [2019-12-27 01:58:10,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:58:10,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:58:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:58:10,252 INFO L87 Difference]: Start difference. First operand 37875 states and 116271 transitions. Second operand 8 states. [2019-12-27 01:58:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:11,709 INFO L93 Difference]: Finished difference Result 56591 states and 171567 transitions. [2019-12-27 01:58:11,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:58:11,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:58:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:11,794 INFO L225 Difference]: With dead ends: 56591 [2019-12-27 01:58:11,794 INFO L226 Difference]: Without dead ends: 56591 [2019-12-27 01:58:11,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:58:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56591 states. [2019-12-27 01:58:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56591 to 36125. [2019-12-27 01:58:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36125 states. [2019-12-27 01:58:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36125 states to 36125 states and 111205 transitions. [2019-12-27 01:58:12,881 INFO L78 Accepts]: Start accepts. Automaton has 36125 states and 111205 transitions. Word has length 63 [2019-12-27 01:58:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:12,882 INFO L462 AbstractCegarLoop]: Abstraction has 36125 states and 111205 transitions. [2019-12-27 01:58:12,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:58:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 36125 states and 111205 transitions. [2019-12-27 01:58:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:12,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:12,925 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] [2019-12-27 01:58:12,926 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:12,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash -346720271, now seen corresponding path program 18 times [2019-12-27 01:58:12,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:12,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839697367] [2019-12-27 01:58:12,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:12,974 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 01:58:12,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839697367] [2019-12-27 01:58:12,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:12,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:12,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277439477] [2019-12-27 01:58:12,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:58:12,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:58:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:12,975 INFO L87 Difference]: Start difference. First operand 36125 states and 111205 transitions. Second operand 4 states. [2019-12-27 01:58:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:13,302 INFO L93 Difference]: Finished difference Result 62112 states and 191244 transitions. [2019-12-27 01:58:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:58:13,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-27 01:58:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:13,376 INFO L225 Difference]: With dead ends: 62112 [2019-12-27 01:58:13,376 INFO L226 Difference]: Without dead ends: 28680 [2019-12-27 01:58:13,377 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 01:58:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28680 states. [2019-12-27 01:58:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28680 to 28680. [2019-12-27 01:58:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-12-27 01:58:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 88208 transitions. [2019-12-27 01:58:13,971 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 88208 transitions. Word has length 63 [2019-12-27 01:58:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:13,972 INFO L462 AbstractCegarLoop]: Abstraction has 28680 states and 88208 transitions. [2019-12-27 01:58:13,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:58:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 88208 transitions. [2019-12-27 01:58:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:14,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:14,007 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] [2019-12-27 01:58:14,007 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:14,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash -202587373, now seen corresponding path program 19 times [2019-12-27 01:58:14,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:14,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319839708] [2019-12-27 01:58:14,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:14,085 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 01:58:14,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319839708] [2019-12-27 01:58:14,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:14,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:58:14,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912918076] [2019-12-27 01:58:14,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:58:14,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:14,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:58:14,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:14,087 INFO L87 Difference]: Start difference. First operand 28680 states and 88208 transitions. Second operand 7 states. [2019-12-27 01:58:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:14,603 INFO L93 Difference]: Finished difference Result 68160 states and 207095 transitions. [2019-12-27 01:58:14,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:58:14,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:58:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:14,697 INFO L225 Difference]: With dead ends: 68160 [2019-12-27 01:58:14,698 INFO L226 Difference]: Without dead ends: 58782 [2019-12-27 01:58:14,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:58:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58782 states. [2019-12-27 01:58:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58782 to 28589. [2019-12-27 01:58:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28589 states. [2019-12-27 01:58:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28589 states to 28589 states and 87760 transitions. [2019-12-27 01:58:15,400 INFO L78 Accepts]: Start accepts. Automaton has 28589 states and 87760 transitions. Word has length 63 [2019-12-27 01:58:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:15,401 INFO L462 AbstractCegarLoop]: Abstraction has 28589 states and 87760 transitions. [2019-12-27 01:58:15,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:58:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 28589 states and 87760 transitions. [2019-12-27 01:58:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:15,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:15,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:58:15,436 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:15,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1974847501, now seen corresponding path program 20 times [2019-12-27 01:58:15,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:15,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789676523] [2019-12-27 01:58:15,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:15,482 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 01:58:15,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789676523] [2019-12-27 01:58:15,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:15,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:58:15,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928891948] [2019-12-27 01:58:15,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:58:15,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:15,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:58:15,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:58:15,484 INFO L87 Difference]: Start difference. First operand 28589 states and 87760 transitions. Second operand 3 states. [2019-12-27 01:58:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:15,637 INFO L93 Difference]: Finished difference Result 49258 states and 150848 transitions. [2019-12-27 01:58:15,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:58:15,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 01:58:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:15,668 INFO L225 Difference]: With dead ends: 49258 [2019-12-27 01:58:15,668 INFO L226 Difference]: Without dead ends: 21743 [2019-12-27 01:58:15,668 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 01:58:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21743 states. [2019-12-27 01:58:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21743 to 21743. [2019-12-27 01:58:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21743 states. [2019-12-27 01:58:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21743 states to 21743 states and 66053 transitions. [2019-12-27 01:58:16,278 INFO L78 Accepts]: Start accepts. Automaton has 21743 states and 66053 transitions. Word has length 63 [2019-12-27 01:58:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:16,279 INFO L462 AbstractCegarLoop]: Abstraction has 21743 states and 66053 transitions. [2019-12-27 01:58:16,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:58:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21743 states and 66053 transitions. [2019-12-27 01:58:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:58:16,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:16,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:16,300 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:16,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:16,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1205251063, now seen corresponding path program 1 times [2019-12-27 01:58:16,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:16,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858663165] [2019-12-27 01:58:16,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:16,402 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 01:58:16,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858663165] [2019-12-27 01:58:16,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:16,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:58:16,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150354210] [2019-12-27 01:58:16,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:58:16,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:16,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:58:16,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:58:16,403 INFO L87 Difference]: Start difference. First operand 21743 states and 66053 transitions. Second operand 6 states. [2019-12-27 01:58:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:17,046 INFO L93 Difference]: Finished difference Result 28925 states and 86826 transitions. [2019-12-27 01:58:17,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:58:17,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 01:58:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:17,085 INFO L225 Difference]: With dead ends: 28925 [2019-12-27 01:58:17,086 INFO L226 Difference]: Without dead ends: 28925 [2019-12-27 01:58:17,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:58:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28925 states. [2019-12-27 01:58:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28925 to 23585. [2019-12-27 01:58:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23585 states. [2019-12-27 01:58:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23585 states to 23585 states and 71492 transitions. [2019-12-27 01:58:17,462 INFO L78 Accepts]: Start accepts. Automaton has 23585 states and 71492 transitions. Word has length 64 [2019-12-27 01:58:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:17,462 INFO L462 AbstractCegarLoop]: Abstraction has 23585 states and 71492 transitions. [2019-12-27 01:58:17,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:58:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23585 states and 71492 transitions. [2019-12-27 01:58:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:58:17,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:17,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:17,485 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:17,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash 230927717, now seen corresponding path program 2 times [2019-12-27 01:58:17,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:17,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146163175] [2019-12-27 01:58:17,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:17,658 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 01:58:17,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146163175] [2019-12-27 01:58:17,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:17,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:58:17,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108356938] [2019-12-27 01:58:17,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:58:17,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:17,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:58:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:58:17,660 INFO L87 Difference]: Start difference. First operand 23585 states and 71492 transitions. Second operand 10 states. [2019-12-27 01:58:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:18,926 INFO L93 Difference]: Finished difference Result 35397 states and 106291 transitions. [2019-12-27 01:58:18,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:58:18,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 01:58:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:18,967 INFO L225 Difference]: With dead ends: 35397 [2019-12-27 01:58:18,968 INFO L226 Difference]: Without dead ends: 28328 [2019-12-27 01:58:18,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:58:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28328 states. [2019-12-27 01:58:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28328 to 24137. [2019-12-27 01:58:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24137 states. [2019-12-27 01:58:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24137 states to 24137 states and 73066 transitions. [2019-12-27 01:58:19,341 INFO L78 Accepts]: Start accepts. Automaton has 24137 states and 73066 transitions. Word has length 64 [2019-12-27 01:58:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:19,341 INFO L462 AbstractCegarLoop]: Abstraction has 24137 states and 73066 transitions. [2019-12-27 01:58:19,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:58:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 24137 states and 73066 transitions. [2019-12-27 01:58:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:58:19,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:19,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:19,368 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:19,369 INFO L82 PathProgramCache]: Analyzing trace with hash -477512813, now seen corresponding path program 3 times [2019-12-27 01:58:19,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:19,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39417685] [2019-12-27 01:58:19,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:19,560 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 01:58:19,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39417685] [2019-12-27 01:58:19,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:19,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:19,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955594824] [2019-12-27 01:58:19,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:58:19,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:19,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:58:19,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:19,561 INFO L87 Difference]: Start difference. First operand 24137 states and 73066 transitions. Second operand 11 states. [2019-12-27 01:58:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:21,227 INFO L93 Difference]: Finished difference Result 38535 states and 114490 transitions. [2019-12-27 01:58:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:58:21,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 01:58:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:21,272 INFO L225 Difference]: With dead ends: 38535 [2019-12-27 01:58:21,272 INFO L226 Difference]: Without dead ends: 33042 [2019-12-27 01:58:21,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:58:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33042 states. [2019-12-27 01:58:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33042 to 24202. [2019-12-27 01:58:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24202 states. [2019-12-27 01:58:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24202 states to 24202 states and 73098 transitions. [2019-12-27 01:58:21,997 INFO L78 Accepts]: Start accepts. Automaton has 24202 states and 73098 transitions. Word has length 64 [2019-12-27 01:58:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:21,997 INFO L462 AbstractCegarLoop]: Abstraction has 24202 states and 73098 transitions. [2019-12-27 01:58:21,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:58:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 24202 states and 73098 transitions. [2019-12-27 01:58:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:58:22,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:22,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:22,023 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:22,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:22,023 INFO L82 PathProgramCache]: Analyzing trace with hash -524839499, now seen corresponding path program 4 times [2019-12-27 01:58:22,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:22,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757248389] [2019-12-27 01:58:22,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:22,184 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 01:58:22,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757248389] [2019-12-27 01:58:22,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:22,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:22,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984608018] [2019-12-27 01:58:22,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:58:22,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:58:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:22,186 INFO L87 Difference]: Start difference. First operand 24202 states and 73098 transitions. Second operand 11 states. [2019-12-27 01:58:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:23,087 INFO L93 Difference]: Finished difference Result 31211 states and 93096 transitions. [2019-12-27 01:58:23,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:58:23,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 01:58:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:23,127 INFO L225 Difference]: With dead ends: 31211 [2019-12-27 01:58:23,127 INFO L226 Difference]: Without dead ends: 28737 [2019-12-27 01:58:23,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:58:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28737 states. [2019-12-27 01:58:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28737 to 22791. [2019-12-27 01:58:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22791 states. [2019-12-27 01:58:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22791 states to 22791 states and 68305 transitions. [2019-12-27 01:58:23,496 INFO L78 Accepts]: Start accepts. Automaton has 22791 states and 68305 transitions. Word has length 64 [2019-12-27 01:58:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:23,496 INFO L462 AbstractCegarLoop]: Abstraction has 22791 states and 68305 transitions. [2019-12-27 01:58:23,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:58:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 22791 states and 68305 transitions. [2019-12-27 01:58:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:58:23,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:23,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:23,520 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2110292585, now seen corresponding path program 5 times [2019-12-27 01:58:23,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:23,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027906257] [2019-12-27 01:58:23,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:23,690 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 01:58:23,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027906257] [2019-12-27 01:58:23,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:23,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:23,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412579159] [2019-12-27 01:58:23,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:58:23,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:58:23,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:23,691 INFO L87 Difference]: Start difference. First operand 22791 states and 68305 transitions. Second operand 11 states. [2019-12-27 01:58:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:24,679 INFO L93 Difference]: Finished difference Result 27030 states and 79610 transitions. [2019-12-27 01:58:24,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:58:24,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 01:58:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:24,713 INFO L225 Difference]: With dead ends: 27030 [2019-12-27 01:58:24,713 INFO L226 Difference]: Without dead ends: 22982 [2019-12-27 01:58:24,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:58:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22982 states. [2019-12-27 01:58:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22982 to 21115. [2019-12-27 01:58:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21115 states. [2019-12-27 01:58:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21115 states to 21115 states and 62977 transitions. [2019-12-27 01:58:25,038 INFO L78 Accepts]: Start accepts. Automaton has 21115 states and 62977 transitions. Word has length 64 [2019-12-27 01:58:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:25,038 INFO L462 AbstractCegarLoop]: Abstraction has 21115 states and 62977 transitions. [2019-12-27 01:58:25,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:58:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 21115 states and 62977 transitions. [2019-12-27 01:58:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:58:25,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:58:25,061 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:25,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash 117680357, now seen corresponding path program 6 times [2019-12-27 01:58:25,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:25,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142970492] [2019-12-27 01:58:25,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:25,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142970492] [2019-12-27 01:58:25,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:25,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:58:25,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762920211] [2019-12-27 01:58:25,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:58:25,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:25,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:58:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:58:25,118 INFO L87 Difference]: Start difference. First operand 21115 states and 62977 transitions. Second operand 3 states. [2019-12-27 01:58:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:25,179 INFO L93 Difference]: Finished difference Result 21114 states and 62975 transitions. [2019-12-27 01:58:25,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:58:25,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:58:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:25,208 INFO L225 Difference]: With dead ends: 21114 [2019-12-27 01:58:25,208 INFO L226 Difference]: Without dead ends: 21114 [2019-12-27 01:58:25,209 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 01:58:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21114 states. [2019-12-27 01:58:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21114 to 17771. [2019-12-27 01:58:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17771 states. [2019-12-27 01:58:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17771 states to 17771 states and 53510 transitions. [2019-12-27 01:58:25,512 INFO L78 Accepts]: Start accepts. Automaton has 17771 states and 53510 transitions. Word has length 64 [2019-12-27 01:58:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:25,512 INFO L462 AbstractCegarLoop]: Abstraction has 17771 states and 53510 transitions. [2019-12-27 01:58:25,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:58:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 17771 states and 53510 transitions. [2019-12-27 01:58:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:58:25,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:25,532 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 01:58:25,532 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:25,533 INFO L82 PathProgramCache]: Analyzing trace with hash 51203325, now seen corresponding path program 1 times [2019-12-27 01:58:25,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:25,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292895467] [2019-12-27 01:58:25,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:25,626 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 01:58:25,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292895467] [2019-12-27 01:58:25,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:25,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:58:25,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057404398] [2019-12-27 01:58:25,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:58:25,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:25,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:58:25,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:58:25,629 INFO L87 Difference]: Start difference. First operand 17771 states and 53510 transitions. Second operand 8 states. [2019-12-27 01:58:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:26,611 INFO L93 Difference]: Finished difference Result 24274 states and 71925 transitions. [2019-12-27 01:58:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:58:26,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 01:58:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:26,646 INFO L225 Difference]: With dead ends: 24274 [2019-12-27 01:58:26,646 INFO L226 Difference]: Without dead ends: 24274 [2019-12-27 01:58:26,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:58:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24274 states. [2019-12-27 01:58:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24274 to 17561. [2019-12-27 01:58:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17561 states. [2019-12-27 01:58:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17561 states to 17561 states and 52945 transitions. [2019-12-27 01:58:26,961 INFO L78 Accepts]: Start accepts. Automaton has 17561 states and 52945 transitions. Word has length 65 [2019-12-27 01:58:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:26,962 INFO L462 AbstractCegarLoop]: Abstraction has 17561 states and 52945 transitions. [2019-12-27 01:58:26,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:58:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 17561 states and 52945 transitions. [2019-12-27 01:58:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:58:27,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:27,147 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 01:58:27,147 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash -330874671, now seen corresponding path program 2 times [2019-12-27 01:58:27,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:27,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563567331] [2019-12-27 01:58:27,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:27,294 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 01:58:27,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563567331] [2019-12-27 01:58:27,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:27,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:27,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690413324] [2019-12-27 01:58:27,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:58:27,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:58:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:27,296 INFO L87 Difference]: Start difference. First operand 17561 states and 52945 transitions. Second operand 11 states. [2019-12-27 01:58:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:28,070 INFO L93 Difference]: Finished difference Result 21358 states and 63600 transitions. [2019-12-27 01:58:28,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:58:28,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 01:58:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:28,095 INFO L225 Difference]: With dead ends: 21358 [2019-12-27 01:58:28,096 INFO L226 Difference]: Without dead ends: 18110 [2019-12-27 01:58:28,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:58:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18110 states. [2019-12-27 01:58:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18110 to 14549. [2019-12-27 01:58:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14549 states. [2019-12-27 01:58:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14549 states to 14549 states and 44102 transitions. [2019-12-27 01:58:28,336 INFO L78 Accepts]: Start accepts. Automaton has 14549 states and 44102 transitions. Word has length 65 [2019-12-27 01:58:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:28,336 INFO L462 AbstractCegarLoop]: Abstraction has 14549 states and 44102 transitions. [2019-12-27 01:58:28,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:58:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 14549 states and 44102 transitions. [2019-12-27 01:58:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:58:28,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:28,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:28,351 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:28,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:28,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 3 times [2019-12-27 01:58:28,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:28,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871492598] [2019-12-27 01:58:28,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:28,434 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 01:58:28,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871492598] [2019-12-27 01:58:28,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:28,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:28,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942483346] [2019-12-27 01:58:28,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:58:28,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:28,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:58:28,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:28,435 INFO L87 Difference]: Start difference. First operand 14549 states and 44102 transitions. Second operand 4 states. [2019-12-27 01:58:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:28,561 INFO L93 Difference]: Finished difference Result 17403 states and 52419 transitions. [2019-12-27 01:58:28,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:58:28,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 01:58:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:28,587 INFO L225 Difference]: With dead ends: 17403 [2019-12-27 01:58:28,588 INFO L226 Difference]: Without dead ends: 17403 [2019-12-27 01:58:28,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2019-12-27 01:58:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 14657. [2019-12-27 01:58:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14657 states. [2019-12-27 01:58:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14657 states to 14657 states and 44541 transitions. [2019-12-27 01:58:28,826 INFO L78 Accepts]: Start accepts. Automaton has 14657 states and 44541 transitions. Word has length 65 [2019-12-27 01:58:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:28,826 INFO L462 AbstractCegarLoop]: Abstraction has 14657 states and 44541 transitions. [2019-12-27 01:58:28,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:58:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14657 states and 44541 transitions. [2019-12-27 01:58:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:28,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:28,841 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 01:58:28,842 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:28,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 1 times [2019-12-27 01:58:28,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:28,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472164399] [2019-12-27 01:58:28,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:29,418 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 01:58:29,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472164399] [2019-12-27 01:58:29,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:29,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 01:58:29,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084905343] [2019-12-27 01:58:29,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 01:58:29,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:29,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 01:58:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:58:29,420 INFO L87 Difference]: Start difference. First operand 14657 states and 44541 transitions. Second operand 17 states. [2019-12-27 01:58:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:31,997 INFO L93 Difference]: Finished difference Result 18821 states and 56019 transitions. [2019-12-27 01:58:31,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 01:58:31,997 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 01:58:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:32,025 INFO L225 Difference]: With dead ends: 18821 [2019-12-27 01:58:32,025 INFO L226 Difference]: Without dead ends: 18322 [2019-12-27 01:58:32,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=1401, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 01:58:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18322 states. [2019-12-27 01:58:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18322 to 14579. [2019-12-27 01:58:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14579 states. [2019-12-27 01:58:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14579 states to 14579 states and 44337 transitions. [2019-12-27 01:58:32,264 INFO L78 Accepts]: Start accepts. Automaton has 14579 states and 44337 transitions. Word has length 66 [2019-12-27 01:58:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:32,264 INFO L462 AbstractCegarLoop]: Abstraction has 14579 states and 44337 transitions. [2019-12-27 01:58:32,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 01:58:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 14579 states and 44337 transitions. [2019-12-27 01:58:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:32,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:32,279 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 01:58:32,279 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:32,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2033523235, now seen corresponding path program 2 times [2019-12-27 01:58:32,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:32,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395766983] [2019-12-27 01:58:32,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:32,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395766983] [2019-12-27 01:58:32,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:32,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:32,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329232282] [2019-12-27 01:58:32,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:58:32,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:32,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:58:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:32,432 INFO L87 Difference]: Start difference. First operand 14579 states and 44337 transitions. Second operand 11 states. [2019-12-27 01:58:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:33,288 INFO L93 Difference]: Finished difference Result 17472 states and 52316 transitions. [2019-12-27 01:58:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:58:33,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:58:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:33,312 INFO L225 Difference]: With dead ends: 17472 [2019-12-27 01:58:33,313 INFO L226 Difference]: Without dead ends: 17081 [2019-12-27 01:58:33,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:58:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17081 states. [2019-12-27 01:58:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17081 to 14395. [2019-12-27 01:58:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14395 states. [2019-12-27 01:58:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14395 states to 14395 states and 43871 transitions. [2019-12-27 01:58:33,549 INFO L78 Accepts]: Start accepts. Automaton has 14395 states and 43871 transitions. Word has length 66 [2019-12-27 01:58:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:33,549 INFO L462 AbstractCegarLoop]: Abstraction has 14395 states and 43871 transitions. [2019-12-27 01:58:33,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:58:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 14395 states and 43871 transitions. [2019-12-27 01:58:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:33,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:33,565 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 01:58:33,565 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 3 times [2019-12-27 01:58:33,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:33,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370394212] [2019-12-27 01:58:33,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:58:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:58:33,666 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:58:33,666 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:58:33,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t660~0.base_22| 4)) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~z$w_buff1_used~0_500 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t660~0.base_22|)) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= (store .cse0 |v_ULTIMATE.start_main_~#t660~0.base_22| 1) |v_#valid_69|) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t660~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t660~0.base_22|) |v_ULTIMATE.start_main_~#t660~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= |v_ULTIMATE.start_main_~#t660~0.offset_16| 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t660~0.base_22|) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t662~0.base=|v_ULTIMATE.start_main_~#t662~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, ULTIMATE.start_main_~#t660~0.offset=|v_ULTIMATE.start_main_~#t660~0.offset_16|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~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_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ULTIMATE.start_main_~#t661~0.offset=|v_ULTIMATE.start_main_~#t661~0.offset_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~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_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ULTIMATE.start_main_~#t660~0.base=|v_ULTIMATE.start_main_~#t660~0.base_22|, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t662~0.offset=|v_ULTIMATE.start_main_~#t662~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380, ULTIMATE.start_main_~#t661~0.base=|v_ULTIMATE.start_main_~#t661~0.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t662~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, ULTIMATE.start_main_~#t660~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t661~0.offset, ~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, ULTIMATE.start_main_~#t660~0.base, ~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, #NULL.base, ULTIMATE.start_main_~#t662~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t661~0.base] because there is no mapped edge [2019-12-27 01:58:33,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} 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 01:58:33,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t661~0.base_11|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t661~0.base_11| 1) |v_#valid_31|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t661~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t661~0.base_11|) |v_ULTIMATE.start_main_~#t661~0.offset_10| 1))) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t661~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t661~0.base_11|) (= |v_ULTIMATE.start_main_~#t661~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t661~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t661~0.offset=|v_ULTIMATE.start_main_~#t661~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t661~0.base=|v_ULTIMATE.start_main_~#t661~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t661~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t661~0.base] because there is no mapped edge [2019-12-27 01:58:33,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t662~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t662~0.base_12|) |v_ULTIMATE.start_main_~#t662~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t662~0.base_12| 0)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t662~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t662~0.base_12| 4) |v_#length_13|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t662~0.base_12|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t662~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t662~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t662~0.offset=|v_ULTIMATE.start_main_~#t662~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t662~0.base=|v_ULTIMATE.start_main_~#t662~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t662~0.offset, ULTIMATE.start_main_~#t662~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 01:58:33,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In955290594 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In955290594 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out955290594| |P1Thread1of1ForFork2_#t~ite10_Out955290594|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out955290594| ~z$w_buff1~0_In955290594) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out955290594| ~z~0_In955290594)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In955290594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In955290594, ~z$w_buff1~0=~z$w_buff1~0_In955290594, ~z~0=~z~0_In955290594} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out955290594|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In955290594, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out955290594|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In955290594, ~z$w_buff1~0=~z$w_buff1~0_In955290594, ~z~0=~z~0_In955290594} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:58:33,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1896625004 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out1896625004| ~z$w_buff1~0_In1896625004) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In1896625004| |P2Thread1of1ForFork0_#t~ite23_Out1896625004|)) (and .cse0 (= ~z$w_buff1~0_In1896625004 |P2Thread1of1ForFork0_#t~ite23_Out1896625004|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1896625004 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1896625004 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1896625004 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1896625004 256)))) (= |P2Thread1of1ForFork0_#t~ite24_Out1896625004| |P2Thread1of1ForFork0_#t~ite23_Out1896625004|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1896625004, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1896625004, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1896625004|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1896625004, ~z$w_buff1~0=~z$w_buff1~0_In1896625004, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1896625004, ~weak$$choice2~0=~weak$$choice2~0_In1896625004} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1896625004, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1896625004|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1896625004, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1896625004|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1896625004, ~z$w_buff1~0=~z$w_buff1~0_In1896625004, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1896625004, ~weak$$choice2~0=~weak$$choice2~0_In1896625004} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:58:33,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse5 (= 0 (mod ~z$r_buff1_thd3~0_In1884599990 256))) (.cse6 (= (mod ~z$r_buff0_thd3~0_In1884599990 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1884599990 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1884599990 256))) (.cse0 (= (mod ~weak$$choice2~0_In1884599990 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite29_Out1884599990| |P2Thread1of1ForFork0_#t~ite30_Out1884599990|))) (or (let ((.cse4 (not .cse6))) (and .cse0 (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_Out1884599990| |P2Thread1of1ForFork0_#t~ite28_Out1884599990|) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out1884599990|) .cse2 (or (not .cse3) .cse4) (or (not .cse5) .cse4))) (and (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out1884599990| |P2Thread1of1ForFork0_#t~ite29_In1884599990|) (not .cse0) (= ~z$w_buff1_used~0_In1884599990 |P2Thread1of1ForFork0_#t~ite30_Out1884599990|)) (and (or (and .cse6 .cse5) (and .cse6 .cse3) .cse1) .cse0 .cse2 (= |P2Thread1of1ForFork0_#t~ite29_Out1884599990| ~z$w_buff1_used~0_In1884599990))) (= |P2Thread1of1ForFork0_#t~ite28_In1884599990| |P2Thread1of1ForFork0_#t~ite28_Out1884599990|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1884599990|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1884599990, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1884599990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1884599990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1884599990, ~weak$$choice2~0=~weak$$choice2~0_In1884599990, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1884599990|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1884599990|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1884599990, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1884599990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1884599990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1884599990, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1884599990|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1884599990|, ~weak$$choice2~0=~weak$$choice2~0_In1884599990} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:58:33,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:58:33,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:58:33,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In496240666 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In496240666 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out496240666| |P2Thread1of1ForFork0_#t~ite38_Out496240666|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff1~0_In496240666 |P2Thread1of1ForFork0_#t~ite38_Out496240666|)) (and (or .cse2 .cse0) .cse1 (= ~z~0_In496240666 |P2Thread1of1ForFork0_#t~ite38_Out496240666|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In496240666, ~z$w_buff1_used~0=~z$w_buff1_used~0_In496240666, ~z$w_buff1~0=~z$w_buff1~0_In496240666, ~z~0=~z~0_In496240666} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out496240666|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out496240666|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In496240666, ~z$w_buff1_used~0=~z$w_buff1_used~0_In496240666, ~z$w_buff1~0=~z$w_buff1~0_In496240666, ~z~0=~z~0_In496240666} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:58:33,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2145016959 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2145016959 256) 0))) (or (and (= ~z$w_buff0_used~0_In-2145016959 |P2Thread1of1ForFork0_#t~ite40_Out-2145016959|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-2145016959|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2145016959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2145016959} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2145016959, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-2145016959|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2145016959} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:58:33,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-287117004 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-287117004 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-287117004 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-287117004 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-287117004| ~z$w_buff1_used~0_In-287117004)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-287117004| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-287117004, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-287117004, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-287117004, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-287117004} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-287117004, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-287117004, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-287117004, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-287117004, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-287117004|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:58:33,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1087242938 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1087242938 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1087242938| ~z$r_buff0_thd3~0_In1087242938)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1087242938| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1087242938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1087242938} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1087242938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1087242938, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1087242938|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:58:33,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In212748244 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In212748244 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In212748244 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In212748244 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out212748244|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out212748244| ~z$r_buff1_thd3~0_In212748244)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In212748244, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In212748244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In212748244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In212748244} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out212748244|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In212748244, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In212748244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In212748244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In212748244} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:58:33,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, 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 01:58:33,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1949462127 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1949462127 256) 0))) (or (and (= ~z$w_buff0_used~0_In1949462127 |P0Thread1of1ForFork1_#t~ite5_Out1949462127|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1949462127| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1949462127, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1949462127} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1949462127|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1949462127, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1949462127} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:58:33,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In610777824 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In610777824 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In610777824 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In610777824 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In610777824 |P0Thread1of1ForFork1_#t~ite6_Out610777824|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out610777824| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In610777824, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In610777824, ~z$w_buff1_used~0=~z$w_buff1_used~0_In610777824, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In610777824} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In610777824, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out610777824|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In610777824, ~z$w_buff1_used~0=~z$w_buff1_used~0_In610777824, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In610777824} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:58:33,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1562858651 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1562858651 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1562858651) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out1562858651 ~z$r_buff0_thd1~0_In1562858651) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1562858651, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1562858651} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1562858651, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1562858651|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1562858651} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:58:33,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1743686647 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1743686647 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1743686647 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1743686647 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1743686647| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out1743686647| ~z$r_buff1_thd1~0_In1743686647)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1743686647, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1743686647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1743686647, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1743686647} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1743686647|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1743686647, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1743686647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1743686647, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1743686647} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:58:33,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} 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 01:58:33,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1013845949 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1013845949 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1013845949| ~z$w_buff0_used~0_In-1013845949) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1013845949| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013845949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1013845949} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013845949, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1013845949|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1013845949} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:58:33,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1809014556 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1809014556 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1809014556 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1809014556 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1809014556|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1809014556| ~z$w_buff1_used~0_In-1809014556) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1809014556, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1809014556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1809014556, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1809014556} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1809014556, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1809014556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1809014556, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1809014556|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1809014556} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:58:33,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1531381462 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1531381462 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-1531381462 |P1Thread1of1ForFork2_#t~ite13_Out-1531381462|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1531381462|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1531381462, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1531381462} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1531381462, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1531381462|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1531381462} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:58:33,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1097816029 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1097816029 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1097816029 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1097816029 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1097816029|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In1097816029 |P1Thread1of1ForFork2_#t~ite14_Out1097816029|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1097816029, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1097816029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1097816029, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1097816029} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1097816029, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1097816029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1097816029, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1097816029|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1097816029} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:58:33,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, 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 01:58:33,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:58:33,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1445556187 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1445556187 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1445556187 |ULTIMATE.start_main_#t~ite47_Out1445556187|)) (and (not .cse1) (= ~z$w_buff1~0_In1445556187 |ULTIMATE.start_main_#t~ite47_Out1445556187|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1445556187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1445556187, ~z$w_buff1~0=~z$w_buff1~0_In1445556187, ~z~0=~z~0_In1445556187} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1445556187, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1445556187|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1445556187, ~z$w_buff1~0=~z$w_buff1~0_In1445556187, ~z~0=~z~0_In1445556187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:58:33,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 01:58:33,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1323231876 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1323231876 256)))) (or (and (= ~z$w_buff0_used~0_In-1323231876 |ULTIMATE.start_main_#t~ite49_Out-1323231876|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1323231876| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1323231876, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323231876} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1323231876, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323231876, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1323231876|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:58:33,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-864101001 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-864101001 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-864101001 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-864101001 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-864101001| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-864101001| ~z$w_buff1_used~0_In-864101001) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-864101001, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-864101001, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-864101001, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-864101001} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-864101001|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-864101001, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-864101001, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-864101001, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-864101001} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:58:33,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1652142290 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1652142290 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1652142290| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1652142290 |ULTIMATE.start_main_#t~ite51_Out-1652142290|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1652142290, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1652142290} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1652142290, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1652142290|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1652142290} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:58:33,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1671431857 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1671431857 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1671431857 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1671431857 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1671431857| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out1671431857| ~z$r_buff1_thd0~0_In1671431857) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1671431857, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1671431857, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1671431857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1671431857} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1671431857|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1671431857, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1671431857, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1671431857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1671431857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:58:33,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 01:58:33,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:58:33 BasicIcfg [2019-12-27 01:58:33,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:58:33,771 INFO L168 Benchmark]: Toolchain (without parser) took 147873.72 ms. Allocated memory was 139.5 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 102.7 MB in the beginning and 858.6 MB in the end (delta: -755.9 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 01:58:33,771 INFO L168 Benchmark]: CDTParser took 0.86 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:58:33,775 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.62 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 157.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-27 01:58:33,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.04 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:58:33,776 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:58:33,776 INFO L168 Benchmark]: RCFGBuilder took 872.03 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 102.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:58:33,776 INFO L168 Benchmark]: TraceAbstraction took 146136.31 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.1 MB in the beginning and 858.6 MB in the end (delta: -756.5 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 01:58:33,781 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.86 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.62 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 157.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.04 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.96 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.03 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 102.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146136.31 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.1 MB in the beginning and 858.6 MB in the end (delta: -756.5 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t660, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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] [L827] FCALL, FORK 0 pthread_create(&t661, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t662, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, 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_buff1=0, z$w_buff1_used=0] [L790] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, 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_buff1=0, z$w_buff1_used=0] [L790] 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) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=2, 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_buff1=0, z$w_buff1_used=0] [L791] 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)) [L792] 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)) [L793] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=1, x=1, y=2, 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_buff1=0, z$w_buff1_used=0] [L793] 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)) [L796] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=2, 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_buff1=0, z$w_buff1_used=0] [L796] 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)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, 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_buff1=0, z$w_buff1_used=0] [L802] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, 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] [L802] 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) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 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 [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [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 [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, 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] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 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: 145.8s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 47.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12829 SDtfs, 14577 SDslu, 42099 SDs, 0 SdLazy, 27751 SolverSat, 645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 135 SyntacticMatches, 49 SemanticMatches, 525 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1637 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 63.7s AutomataMinimizationTime, 48 MinimizatonAttempts, 508190 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2456 NumberOfCodeBlocks, 2456 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2342 ConstructedInterpolants, 0 QuantifiedInterpolants, 562900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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...