/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/mix019_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:43:06,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:43:06,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:43:06,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:43:06,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:43:06,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:43:06,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:43:06,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:43:06,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:43:06,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:43:06,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:43:06,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:43:06,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:43:06,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:43:06,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:43:06,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:43:06,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:43:06,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:43:06,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:43:06,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:43:06,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:43:06,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:43:06,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:43:06,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:43:06,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:43:06,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:43:06,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:43:06,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:43:06,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:43:06,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:43:06,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:43:06,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:43:06,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:43:06,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:43:06,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:43:06,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:43:06,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:43:06,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:43:06,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:43:06,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:43:06,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:43:06,700 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:43:06,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:43:06,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:43:06,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:43:06,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:43:06,720 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:43:06,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:43:06,721 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:43:06,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:43:06,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:43:06,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:43:06,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:43:06,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:43:06,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:43:06,723 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:43:06,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:43:06,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:43:06,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:43:06,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:43:06,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:43:06,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:43:06,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:43:06,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:43:06,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:43:06,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:43:06,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:43:06,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:43:06,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:43:06,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:43:06,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:43:06,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:43:07,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:43:07,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:43:07,012 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:43:07,013 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:43:07,013 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-27 01:43:07,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e972208/625a5d4e64f841fa947912b1a4088af0/FLAGd87162306 [2019-12-27 01:43:07,619 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:43:07,620 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-27 01:43:07,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e972208/625a5d4e64f841fa947912b1a4088af0/FLAGd87162306 [2019-12-27 01:43:07,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e972208/625a5d4e64f841fa947912b1a4088af0 [2019-12-27 01:43:07,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:43:07,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:43:07,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:43:07,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:43:07,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:43:07,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:43:07" (1/1) ... [2019-12-27 01:43:07,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:07, skipping insertion in model container [2019-12-27 01:43:07,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:43:07" (1/1) ... [2019-12-27 01:43:07,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:43:08,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:43:08,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:43:08,571 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:43:08,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:43:08,727 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:43:08,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08 WrapperNode [2019-12-27 01:43:08,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:43:08,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:43:08,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:43:08,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:43:08,739 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:43:08" (1/1) ... [2019-12-27 01:43:08,760 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:43:08" (1/1) ... [2019-12-27 01:43:08,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:43:08,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:43:08,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:43:08,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:43:08,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08" (1/1) ... [2019-12-27 01:43:08,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08" (1/1) ... [2019-12-27 01:43:08,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08" (1/1) ... [2019-12-27 01:43:08,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08" (1/1) ... [2019-12-27 01:43:08,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08" (1/1) ... [2019-12-27 01:43:08,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08" (1/1) ... [2019-12-27 01:43:08,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08" (1/1) ... [2019-12-27 01:43:08,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:43:08,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:43:08,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:43:08,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:43:08,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08" (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:43:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:43:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:43:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:43:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:43:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:43:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:43:08,911 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:43:08,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:43:08,911 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:43:08,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:43:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:43:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:43:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:43:08,917 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:43:09,670 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:43:09,671 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:43:09,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:43:09 BoogieIcfgContainer [2019-12-27 01:43:09,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:43:09,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:43:09,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:43:09,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:43:09,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:43:07" (1/3) ... [2019-12-27 01:43:09,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c096022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:43:09, skipping insertion in model container [2019-12-27 01:43:09,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:08" (2/3) ... [2019-12-27 01:43:09,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c096022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:43:09, skipping insertion in model container [2019-12-27 01:43:09,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:43:09" (3/3) ... [2019-12-27 01:43:09,681 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_pso.oepc.i [2019-12-27 01:43:09,692 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:43:09,692 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:43:09,700 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:43:09,701 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:43:09,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,773 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,773 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,781 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,782 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,809 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,811 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,819 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:09,852 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:43:09,875 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:43:09,875 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:43:09,875 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:43:09,875 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:43:09,875 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:43:09,875 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:43:09,876 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:43:09,876 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:43:09,899 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 01:43:09,901 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:43:10,017 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:43:10,017 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:43:10,037 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:43:10,060 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:43:10,155 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:43:10,156 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:43:10,169 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:43:10,190 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:43:10,191 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:43:15,536 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 01:43:15,664 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 01:43:15,922 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 01:43:15,922 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 01:43:15,925 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 01:43:37,897 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 01:43:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 01:43:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:43:37,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:37,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:43:37,905 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:43:37,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:37,912 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 01:43:37,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:37,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849775679] [2019-12-27 01:43:37,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:43:38,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849775679] [2019-12-27 01:43:38,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:38,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:43:38,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31475024] [2019-12-27 01:43:38,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:43:38,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:38,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:43:38,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:43:38,224 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 01:43:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:39,885 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 01:43:39,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:43:39,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:43:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:43,914 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 01:43:43,914 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 01:43:43,916 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:43:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 01:43:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 01:43:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 01:43:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 01:43:51,252 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 01:43:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:51,253 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 01:43:51,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:43:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 01:43:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:43:51,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:51,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:43:51,258 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:43:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 01:43:51,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:51,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189472487] [2019-12-27 01:43:51,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:43:51,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189472487] [2019-12-27 01:43:51,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:51,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:43:51,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594275345] [2019-12-27 01:43:51,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:43:51,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:51,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:43:51,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:43:51,394 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 01:43:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:57,377 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 01:43:57,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:43:57,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:43:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:58,209 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 01:43:58,209 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 01:43:58,210 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:44:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 01:44:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 01:44:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 01:44:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 01:44:10,162 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 01:44:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:10,163 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 01:44:10,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:44:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 01:44:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:44:10,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:10,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:10,171 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:44:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 01:44:10,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:10,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917791470] [2019-12-27 01:44:10,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:10,230 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:44:10,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917791470] [2019-12-27 01:44:10,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:10,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:10,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357712764] [2019-12-27 01:44:10,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:10,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:10,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:10,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:10,232 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 01:44:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:10,374 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 01:44:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:10,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:44:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:10,440 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 01:44:10,440 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 01:44:10,441 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:44:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 01:44:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 01:44:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 01:44:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 01:44:15,981 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 01:44:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:15,982 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 01:44:15,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 01:44:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:44:15,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:15,985 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:44:15,986 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:44:15,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:15,986 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 01:44:15,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:15,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798298572] [2019-12-27 01:44:15,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:16,053 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:44:16,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798298572] [2019-12-27 01:44:16,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:16,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:16,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206116509] [2019-12-27 01:44:16,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:16,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:16,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:16,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:16,056 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 01:44:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:16,267 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 01:44:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:16,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:44:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:16,353 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 01:44:16,354 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 01:44:16,354 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:44:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 01:44:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 01:44:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 01:44:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 01:44:17,083 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 01:44:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:17,085 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 01:44:17,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 01:44:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:44:17,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:17,088 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:44:17,088 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:44:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:17,088 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 01:44:17,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:17,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902500020] [2019-12-27 01:44:17,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:17,163 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:44:17,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902500020] [2019-12-27 01:44:17,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:17,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:17,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404658734] [2019-12-27 01:44:17,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:44:17,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:44:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:44:17,166 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 01:44:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:17,515 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 01:44:17,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:44:17,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:44:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:17,592 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 01:44:17,592 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 01:44:17,592 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:44:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 01:44:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 01:44:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 01:44:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 01:44:18,787 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 01:44:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:18,787 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 01:44:18,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:44:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 01:44:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:44:18,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:18,791 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:44:18,791 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:44:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 01:44:18,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:18,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790199566] [2019-12-27 01:44:18,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:18,846 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:44:18,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790199566] [2019-12-27 01:44:18,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:18,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:18,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616097072] [2019-12-27 01:44:18,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:44:18,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:18,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:44:18,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:44:18,848 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 01:44:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:19,207 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 01:44:19,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:44:19,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:44:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:19,287 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 01:44:19,287 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 01:44:19,288 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:44:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 01:44:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 01:44:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 01:44:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 01:44:20,100 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 01:44:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:20,101 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 01:44:20,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:44:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 01:44:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:44:20,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:20,111 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:44:20,111 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:44:20,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:20,111 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 01:44:20,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:20,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095970637] [2019-12-27 01:44:20,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:20,248 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:44:20,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095970637] [2019-12-27 01:44:20,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:20,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:20,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960647331] [2019-12-27 01:44:20,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:20,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:20,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:20,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:20,253 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 01:44:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:21,322 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 01:44:21,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:44:21,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:44:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:21,429 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 01:44:21,429 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 01:44:21,430 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:44:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 01:44:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 01:44:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 01:44:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 01:44:22,368 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 01:44:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:22,369 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 01:44:22,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 01:44:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:44:22,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:22,379 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:44:22,379 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:44:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 01:44:22,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:22,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937116741] [2019-12-27 01:44:22,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:22,445 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:44:22,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937116741] [2019-12-27 01:44:22,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:22,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:22,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790103885] [2019-12-27 01:44:22,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:22,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:22,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:22,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:22,447 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 01:44:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:23,088 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 01:44:23,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:44:23,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:44:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:23,193 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 01:44:23,193 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 01:44:23,194 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:44:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 01:44:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 01:44:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 01:44:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 01:44:24,597 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 01:44:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:24,597 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 01:44:24,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 01:44:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:44:24,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:24,611 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:44:24,611 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:44:24,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 01:44:24,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:24,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415364448] [2019-12-27 01:44:24,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:24,660 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:44:24,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415364448] [2019-12-27 01:44:24,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:24,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:24,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804764246] [2019-12-27 01:44:24,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:44:24,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:44:24,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:44:24,663 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-27 01:44:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:24,730 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 01:44:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:44:24,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:44:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:24,754 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 01:44:24,754 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 01:44:24,755 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:44:24,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 01:44:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 01:44:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 01:44:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 01:44:24,996 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 01:44:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:24,996 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 01:44:24,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:44:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 01:44:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:44:25,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:25,009 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:44:25,009 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:44:25,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 01:44:25,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:25,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386138971] [2019-12-27 01:44:25,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:25,077 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:44:25,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386138971] [2019-12-27 01:44:25,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:25,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:25,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173629595] [2019-12-27 01:44:25,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:25,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:25,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:25,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:25,079 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 01:44:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:25,400 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 01:44:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:44:25,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 01:44:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:25,432 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 01:44:25,432 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 01:44:25,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:44:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 01:44:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 01:44:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 01:44:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 01:44:25,725 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 01:44:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:25,726 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 01:44:25,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 01:44:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:44:25,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:25,740 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:44:25,740 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:44:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:25,741 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 01:44:25,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:25,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329947041] [2019-12-27 01:44:25,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:25,803 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:44:25,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329947041] [2019-12-27 01:44:25,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:25,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:25,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562018601] [2019-12-27 01:44:25,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:25,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:25,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:25,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:25,805 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 01:44:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:26,248 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 01:44:26,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:44:26,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:44:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:26,292 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 01:44:26,293 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 01:44:26,293 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:44:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 01:44:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 01:44:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 01:44:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 01:44:26,674 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 01:44:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:26,674 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 01:44:26,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 01:44:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 01:44:26,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:26,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:26,694 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:44:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:26,694 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 01:44:26,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:26,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439304366] [2019-12-27 01:44:26,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:26,769 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:44:26,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439304366] [2019-12-27 01:44:26,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:26,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:44:26,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888413777] [2019-12-27 01:44:26,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:44:26,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:26,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:44:26,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:44:26,772 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-27 01:44:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:27,432 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-27 01:44:27,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:44:27,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 01:44:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:27,469 INFO L225 Difference]: With dead ends: 27031 [2019-12-27 01:44:27,469 INFO L226 Difference]: Without dead ends: 27031 [2019-12-27 01:44:27,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:44:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-27 01:44:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-27 01:44:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-27 01:44:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-27 01:44:28,119 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-27 01:44:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:28,120 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-27 01:44:28,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:44:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-27 01:44:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:44:28,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:28,142 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:44:28,142 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:44:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:28,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 01:44:28,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:28,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896913155] [2019-12-27 01:44:28,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:28,248 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:44:28,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896913155] [2019-12-27 01:44:28,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:28,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:44:28,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18012203] [2019-12-27 01:44:28,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:44:28,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:44:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:44:28,252 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-27 01:44:28,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:28,955 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-27 01:44:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:44:28,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 01:44:28,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:28,992 INFO L225 Difference]: With dead ends: 26334 [2019-12-27 01:44:28,992 INFO L226 Difference]: Without dead ends: 26334 [2019-12-27 01:44:28,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:44:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-27 01:44:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-27 01:44:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-27 01:44:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-27 01:44:29,297 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-27 01:44:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:29,297 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-27 01:44:29,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:44:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-27 01:44:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:44:29,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:29,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:29,313 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:44:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 01:44:29,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:29,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308809250] [2019-12-27 01:44:29,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:29,372 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:44:29,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308809250] [2019-12-27 01:44:29,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:29,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:44:29,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915542133] [2019-12-27 01:44:29,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:29,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:29,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:29,374 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-27 01:44:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:29,440 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-27 01:44:29,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:29,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:44:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:29,471 INFO L225 Difference]: With dead ends: 17641 [2019-12-27 01:44:29,471 INFO L226 Difference]: Without dead ends: 17641 [2019-12-27 01:44:29,472 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:44:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-27 01:44:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-27 01:44:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-27 01:44:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-27 01:44:29,892 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-27 01:44:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:29,893 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-27 01:44:29,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-27 01:44:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:44:29,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:29,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:29,920 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:44:29,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:29,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 01:44:29,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:29,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534219973] [2019-12-27 01:44:29,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:30,014 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:44:30,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534219973] [2019-12-27 01:44:30,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:30,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:44:30,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822990919] [2019-12-27 01:44:30,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:30,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:30,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:30,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:30,016 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-27 01:44:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:30,597 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-27 01:44:30,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:44:30,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:44:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:30,641 INFO L225 Difference]: With dead ends: 25346 [2019-12-27 01:44:30,641 INFO L226 Difference]: Without dead ends: 25346 [2019-12-27 01:44:30,641 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:44:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-27 01:44:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-27 01:44:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-27 01:44:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-27 01:44:31,002 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-27 01:44:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:31,002 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-27 01:44:31,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-27 01:44:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:44:31,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:31,030 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:44:31,030 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:44:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 01:44:31,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:31,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967952848] [2019-12-27 01:44:31,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:31,091 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:44:31,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967952848] [2019-12-27 01:44:31,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:31,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:44:31,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482126766] [2019-12-27 01:44:31,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:31,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:31,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:31,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:31,093 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-27 01:44:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:31,196 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-27 01:44:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:44:31,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:44:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:31,236 INFO L225 Difference]: With dead ends: 22175 [2019-12-27 01:44:31,236 INFO L226 Difference]: Without dead ends: 22175 [2019-12-27 01:44:31,236 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:44:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-27 01:44:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-27 01:44:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-27 01:44:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-27 01:44:31,566 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-27 01:44:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:31,566 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-27 01:44:31,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-27 01:44:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:44:31,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:31,596 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:44:31,596 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:44:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:31,597 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 01:44:31,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:31,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116703901] [2019-12-27 01:44:31,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:32,005 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:44:32,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116703901] [2019-12-27 01:44:32,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:32,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:44:32,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327483733] [2019-12-27 01:44:32,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:44:32,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:32,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:44:32,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:44:32,007 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-27 01:44:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:32,653 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-27 01:44:32,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:44:32,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:44:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:32,751 INFO L225 Difference]: With dead ends: 62478 [2019-12-27 01:44:32,751 INFO L226 Difference]: Without dead ends: 47634 [2019-12-27 01:44:32,752 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:44:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-27 01:44:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-27 01:44:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-27 01:44:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-27 01:44:33,330 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-27 01:44:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:33,330 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-27 01:44:33,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:44:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-27 01:44:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:44:33,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:33,367 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:44:33,367 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:44:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 01:44:33,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:33,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707502627] [2019-12-27 01:44:33,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:33,462 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:44:33,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707502627] [2019-12-27 01:44:33,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:33,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:44:33,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62084834] [2019-12-27 01:44:33,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:44:33,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:33,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:44:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:44:33,470 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-27 01:44:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:34,043 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-27 01:44:34,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:44:34,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:44:34,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:34,122 INFO L225 Difference]: With dead ends: 68433 [2019-12-27 01:44:34,123 INFO L226 Difference]: Without dead ends: 48478 [2019-12-27 01:44:34,123 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:44:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-27 01:44:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-27 01:44:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-27 01:44:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-27 01:44:34,777 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-27 01:44:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:34,778 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-27 01:44:34,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:44:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-27 01:44:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:44:34,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:34,830 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:44:34,830 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:44:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:34,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 01:44:34,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:34,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992390794] [2019-12-27 01:44:34,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:34,912 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:44:34,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992390794] [2019-12-27 01:44:34,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:34,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:44:34,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821768913] [2019-12-27 01:44:34,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:44:34,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:34,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:44:34,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:44:34,915 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-27 01:44:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:35,467 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-27 01:44:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:44:35,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:44:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:35,548 INFO L225 Difference]: With dead ends: 59843 [2019-12-27 01:44:35,548 INFO L226 Difference]: Without dead ends: 52762 [2019-12-27 01:44:35,548 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:44:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-27 01:44:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-27 01:44:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-27 01:44:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-27 01:44:36,530 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-27 01:44:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:36,530 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-27 01:44:36,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:44:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-27 01:44:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:44:36,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:36,562 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:44:36,564 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:44:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 01:44:36,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:36,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506463259] [2019-12-27 01:44:36,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:36,627 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:44:36,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506463259] [2019-12-27 01:44:36,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:36,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:36,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516900939] [2019-12-27 01:44:36,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:36,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:36,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:36,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:36,629 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-27 01:44:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:36,818 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-27 01:44:36,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:36,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 01:44:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:36,870 INFO L225 Difference]: With dead ends: 35624 [2019-12-27 01:44:36,871 INFO L226 Difference]: Without dead ends: 35624 [2019-12-27 01:44:36,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-27 01:44:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-27 01:44:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-27 01:44:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-27 01:44:37,410 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-27 01:44:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:37,410 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-27 01:44:37,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-27 01:44:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:44:37,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:37,445 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:44:37,445 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:44:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-27 01:44:37,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:37,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789564574] [2019-12-27 01:44:37,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:37,688 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:44:37,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789564574] [2019-12-27 01:44:37,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:37,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 01:44:37,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144596073] [2019-12-27 01:44:37,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:44:37,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:37,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:44:37,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:44:37,692 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 12 states. [2019-12-27 01:44:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:42,468 INFO L93 Difference]: Finished difference Result 59312 states and 180291 transitions. [2019-12-27 01:44:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 01:44:42,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 01:44:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:42,548 INFO L225 Difference]: With dead ends: 59312 [2019-12-27 01:44:42,548 INFO L226 Difference]: Without dead ends: 58925 [2019-12-27 01:44:42,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1579, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 01:44:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58925 states. [2019-12-27 01:44:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58925 to 36682. [2019-12-27 01:44:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36682 states. [2019-12-27 01:44:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36682 states to 36682 states and 113249 transitions. [2019-12-27 01:44:43,269 INFO L78 Accepts]: Start accepts. Automaton has 36682 states and 113249 transitions. Word has length 64 [2019-12-27 01:44:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:43,270 INFO L462 AbstractCegarLoop]: Abstraction has 36682 states and 113249 transitions. [2019-12-27 01:44:43,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:44:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 36682 states and 113249 transitions. [2019-12-27 01:44:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:44:43,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:43,315 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:44:43,315 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:44:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash -772692697, now seen corresponding path program 2 times [2019-12-27 01:44:43,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:43,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196576518] [2019-12-27 01:44:43,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:43,531 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:44:43,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196576518] [2019-12-27 01:44:43,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:43,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:44:43,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564287039] [2019-12-27 01:44:43,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:44:43,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:43,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:44:43,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:44:43,533 INFO L87 Difference]: Start difference. First operand 36682 states and 113249 transitions. Second operand 10 states. [2019-12-27 01:44:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:45,514 INFO L93 Difference]: Finished difference Result 58108 states and 177520 transitions. [2019-12-27 01:44:45,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:44:45,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 01:44:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:45,604 INFO L225 Difference]: With dead ends: 58108 [2019-12-27 01:44:45,605 INFO L226 Difference]: Without dead ends: 57888 [2019-12-27 01:44:45,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:44:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57888 states. [2019-12-27 01:44:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57888 to 43232. [2019-12-27 01:44:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43232 states. [2019-12-27 01:44:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43232 states to 43232 states and 133417 transitions. [2019-12-27 01:44:46,389 INFO L78 Accepts]: Start accepts. Automaton has 43232 states and 133417 transitions. Word has length 64 [2019-12-27 01:44:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:46,389 INFO L462 AbstractCegarLoop]: Abstraction has 43232 states and 133417 transitions. [2019-12-27 01:44:46,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:44:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 43232 states and 133417 transitions. [2019-12-27 01:44:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:44:46,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:46,440 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:44:46,440 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:44:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash 98843029, now seen corresponding path program 3 times [2019-12-27 01:44:46,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:46,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38818524] [2019-12-27 01:44:46,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:44:47,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38818524] [2019-12-27 01:44:47,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:47,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 01:44:47,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284930589] [2019-12-27 01:44:47,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:44:47,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:44:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:44:47,195 INFO L87 Difference]: Start difference. First operand 43232 states and 133417 transitions. Second operand 12 states. [2019-12-27 01:44:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:49,827 INFO L93 Difference]: Finished difference Result 62382 states and 189939 transitions. [2019-12-27 01:44:49,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 01:44:49,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 01:44:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:49,932 INFO L225 Difference]: With dead ends: 62382 [2019-12-27 01:44:49,932 INFO L226 Difference]: Without dead ends: 62130 [2019-12-27 01:44:49,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 01:44:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62130 states. [2019-12-27 01:44:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62130 to 42907. [2019-12-27 01:44:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42907 states. [2019-12-27 01:44:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42907 states to 42907 states and 132444 transitions. [2019-12-27 01:44:50,764 INFO L78 Accepts]: Start accepts. Automaton has 42907 states and 132444 transitions. Word has length 64 [2019-12-27 01:44:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:50,764 INFO L462 AbstractCegarLoop]: Abstraction has 42907 states and 132444 transitions. [2019-12-27 01:44:50,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:44:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 42907 states and 132444 transitions. [2019-12-27 01:44:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:44:50,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:50,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:50,814 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:44:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:50,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1550075121, now seen corresponding path program 4 times [2019-12-27 01:44:50,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:50,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862644310] [2019-12-27 01:44:50,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:50,892 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:44:50,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862644310] [2019-12-27 01:44:50,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:50,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:50,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577827172] [2019-12-27 01:44:50,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:50,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:50,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:50,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:50,894 INFO L87 Difference]: Start difference. First operand 42907 states and 132444 transitions. Second operand 3 states. [2019-12-27 01:44:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:51,042 INFO L93 Difference]: Finished difference Result 32991 states and 100832 transitions. [2019-12-27 01:44:51,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:51,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:44:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:51,107 INFO L225 Difference]: With dead ends: 32991 [2019-12-27 01:44:51,108 INFO L226 Difference]: Without dead ends: 32991 [2019-12-27 01:44:51,108 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:44:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32991 states. [2019-12-27 01:44:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32991 to 31051. [2019-12-27 01:44:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31051 states. [2019-12-27 01:44:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31051 states to 31051 states and 94720 transitions. [2019-12-27 01:44:51,625 INFO L78 Accepts]: Start accepts. Automaton has 31051 states and 94720 transitions. Word has length 64 [2019-12-27 01:44:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:51,625 INFO L462 AbstractCegarLoop]: Abstraction has 31051 states and 94720 transitions. [2019-12-27 01:44:51,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 31051 states and 94720 transitions. [2019-12-27 01:44:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:44:51,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:51,661 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:44:51,661 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:44:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash -625357365, now seen corresponding path program 1 times [2019-12-27 01:44:51,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:51,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61231349] [2019-12-27 01:44:51,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:52,378 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 12 [2019-12-27 01:44:52,714 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:44:52,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61231349] [2019-12-27 01:44:52,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:52,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 01:44:52,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233052440] [2019-12-27 01:44:52,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 01:44:52,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:52,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 01:44:52,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:44:52,717 INFO L87 Difference]: Start difference. First operand 31051 states and 94720 transitions. Second operand 16 states. [2019-12-27 01:44:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:56,535 INFO L93 Difference]: Finished difference Result 48663 states and 146418 transitions. [2019-12-27 01:44:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 01:44:56,535 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 01:44:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:56,593 INFO L225 Difference]: With dead ends: 48663 [2019-12-27 01:44:56,594 INFO L226 Difference]: Without dead ends: 41238 [2019-12-27 01:44:56,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=404, Invalid=1666, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 01:44:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41238 states. [2019-12-27 01:44:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41238 to 32006. [2019-12-27 01:44:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32006 states. [2019-12-27 01:44:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32006 states to 32006 states and 97317 transitions. [2019-12-27 01:44:57,130 INFO L78 Accepts]: Start accepts. Automaton has 32006 states and 97317 transitions. Word has length 65 [2019-12-27 01:44:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:57,130 INFO L462 AbstractCegarLoop]: Abstraction has 32006 states and 97317 transitions. [2019-12-27 01:44:57,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 01:44:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 32006 states and 97317 transitions. [2019-12-27 01:44:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:44:57,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:57,168 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:44:57,168 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:44:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:57,168 INFO L82 PathProgramCache]: Analyzing trace with hash -74259335, now seen corresponding path program 2 times [2019-12-27 01:44:57,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:57,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730738374] [2019-12-27 01:44:57,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:57,811 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:44:57,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730738374] [2019-12-27 01:44:57,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:57,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 01:44:57,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417732842] [2019-12-27 01:44:57,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 01:44:57,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 01:44:57,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:44:57,813 INFO L87 Difference]: Start difference. First operand 32006 states and 97317 transitions. Second operand 17 states. [2019-12-27 01:45:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:02,459 INFO L93 Difference]: Finished difference Result 53871 states and 162274 transitions. [2019-12-27 01:45:02,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 01:45:02,460 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-12-27 01:45:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:02,517 INFO L225 Difference]: With dead ends: 53871 [2019-12-27 01:45:02,517 INFO L226 Difference]: Without dead ends: 42678 [2019-12-27 01:45:02,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=533, Invalid=2437, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 01:45:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42678 states. [2019-12-27 01:45:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42678 to 32522. [2019-12-27 01:45:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32522 states. [2019-12-27 01:45:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32522 states to 32522 states and 98707 transitions. [2019-12-27 01:45:03,028 INFO L78 Accepts]: Start accepts. Automaton has 32522 states and 98707 transitions. Word has length 65 [2019-12-27 01:45:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:03,028 INFO L462 AbstractCegarLoop]: Abstraction has 32522 states and 98707 transitions. [2019-12-27 01:45:03,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 01:45:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 32522 states and 98707 transitions. [2019-12-27 01:45:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:45:03,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:03,064 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:45:03,064 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:45:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:03,064 INFO L82 PathProgramCache]: Analyzing trace with hash -628802939, now seen corresponding path program 3 times [2019-12-27 01:45:03,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:03,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763951764] [2019-12-27 01:45:03,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:03,251 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:45:03,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763951764] [2019-12-27 01:45:03,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:03,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:45:03,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650811713] [2019-12-27 01:45:03,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:45:03,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:45:03,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:45:03,253 INFO L87 Difference]: Start difference. First operand 32522 states and 98707 transitions. Second operand 10 states. [2019-12-27 01:45:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:05,576 INFO L93 Difference]: Finished difference Result 52080 states and 155127 transitions. [2019-12-27 01:45:05,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 01:45:05,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 01:45:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:05,651 INFO L225 Difference]: With dead ends: 52080 [2019-12-27 01:45:05,651 INFO L226 Difference]: Without dead ends: 52080 [2019-12-27 01:45:05,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 01:45:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52080 states. [2019-12-27 01:45:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52080 to 35964. [2019-12-27 01:45:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35964 states. [2019-12-27 01:45:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35964 states to 35964 states and 109123 transitions. [2019-12-27 01:45:06,344 INFO L78 Accepts]: Start accepts. Automaton has 35964 states and 109123 transitions. Word has length 65 [2019-12-27 01:45:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:06,344 INFO L462 AbstractCegarLoop]: Abstraction has 35964 states and 109123 transitions. [2019-12-27 01:45:06,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:45:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 35964 states and 109123 transitions. [2019-12-27 01:45:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:45:06,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:06,380 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:45:06,380 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:45:06,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:06,381 INFO L82 PathProgramCache]: Analyzing trace with hash 946511855, now seen corresponding path program 4 times [2019-12-27 01:45:06,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:06,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550800289] [2019-12-27 01:45:06,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:06,609 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:45:06,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550800289] [2019-12-27 01:45:06,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:06,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:45:06,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166862110] [2019-12-27 01:45:06,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:45:06,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:45:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:45:06,612 INFO L87 Difference]: Start difference. First operand 35964 states and 109123 transitions. Second operand 10 states. [2019-12-27 01:45:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:08,273 INFO L93 Difference]: Finished difference Result 49077 states and 148189 transitions. [2019-12-27 01:45:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:45:08,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 01:45:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:08,331 INFO L225 Difference]: With dead ends: 49077 [2019-12-27 01:45:08,332 INFO L226 Difference]: Without dead ends: 40494 [2019-12-27 01:45:08,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:45:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40494 states. [2019-12-27 01:45:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40494 to 35908. [2019-12-27 01:45:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35908 states. [2019-12-27 01:45:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35908 states to 35908 states and 108904 transitions. [2019-12-27 01:45:08,882 INFO L78 Accepts]: Start accepts. Automaton has 35908 states and 108904 transitions. Word has length 65 [2019-12-27 01:45:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:08,883 INFO L462 AbstractCegarLoop]: Abstraction has 35908 states and 108904 transitions. [2019-12-27 01:45:08,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:45:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 35908 states and 108904 transitions. [2019-12-27 01:45:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:45:08,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:08,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:45:08,923 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:45:08,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:08,923 INFO L82 PathProgramCache]: Analyzing trace with hash 459691905, now seen corresponding path program 5 times [2019-12-27 01:45:08,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:08,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591197140] [2019-12-27 01:45:08,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:09,118 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:45:09,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591197140] [2019-12-27 01:45:09,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:09,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:45:09,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136373574] [2019-12-27 01:45:09,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:45:09,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:09,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:45:09,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:45:09,120 INFO L87 Difference]: Start difference. First operand 35908 states and 108904 transitions. Second operand 11 states. [2019-12-27 01:45:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:10,592 INFO L93 Difference]: Finished difference Result 50527 states and 151202 transitions. [2019-12-27 01:45:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:45:10,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 01:45:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:10,651 INFO L225 Difference]: With dead ends: 50527 [2019-12-27 01:45:10,651 INFO L226 Difference]: Without dead ends: 43019 [2019-12-27 01:45:10,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:45:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43019 states. [2019-12-27 01:45:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43019 to 36025. [2019-12-27 01:45:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36025 states. [2019-12-27 01:45:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36025 states to 36025 states and 108896 transitions. [2019-12-27 01:45:11,228 INFO L78 Accepts]: Start accepts. Automaton has 36025 states and 108896 transitions. Word has length 65 [2019-12-27 01:45:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:11,228 INFO L462 AbstractCegarLoop]: Abstraction has 36025 states and 108896 transitions. [2019-12-27 01:45:11,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:45:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 36025 states and 108896 transitions. [2019-12-27 01:45:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:45:11,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:11,268 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:45:11,268 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:45:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1007435361, now seen corresponding path program 6 times [2019-12-27 01:45:11,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:11,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130401148] [2019-12-27 01:45:11,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:45:11,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130401148] [2019-12-27 01:45:11,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:11,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:45:11,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685935165] [2019-12-27 01:45:11,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:45:11,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:11,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:45:11,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:45:11,332 INFO L87 Difference]: Start difference. First operand 36025 states and 108896 transitions. Second operand 3 states. [2019-12-27 01:45:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:11,455 INFO L93 Difference]: Finished difference Result 36024 states and 108894 transitions. [2019-12-27 01:45:11,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:45:11,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:45:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:11,507 INFO L225 Difference]: With dead ends: 36024 [2019-12-27 01:45:11,507 INFO L226 Difference]: Without dead ends: 36024 [2019-12-27 01:45:11,508 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:45:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36024 states. [2019-12-27 01:45:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36024 to 25842. [2019-12-27 01:45:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25842 states. [2019-12-27 01:45:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25842 states to 25842 states and 78977 transitions. [2019-12-27 01:45:12,418 INFO L78 Accepts]: Start accepts. Automaton has 25842 states and 78977 transitions. Word has length 65 [2019-12-27 01:45:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:12,418 INFO L462 AbstractCegarLoop]: Abstraction has 25842 states and 78977 transitions. [2019-12-27 01:45:12,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:45:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 25842 states and 78977 transitions. [2019-12-27 01:45:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:12,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:12,446 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:45:12,446 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:45:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:12,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1631675313, now seen corresponding path program 1 times [2019-12-27 01:45:12,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:12,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655333678] [2019-12-27 01:45:12,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:12,966 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:45:12,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655333678] [2019-12-27 01:45:12,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:12,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 01:45:12,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550437943] [2019-12-27 01:45:12,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 01:45:12,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:12,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 01:45:12,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:45:12,967 INFO L87 Difference]: Start difference. First operand 25842 states and 78977 transitions. Second operand 18 states. [2019-12-27 01:45:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:18,228 INFO L93 Difference]: Finished difference Result 37761 states and 113385 transitions. [2019-12-27 01:45:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 01:45:18,229 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 01:45:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:18,282 INFO L225 Difference]: With dead ends: 37761 [2019-12-27 01:45:18,282 INFO L226 Difference]: Without dead ends: 35964 [2019-12-27 01:45:18,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=482, Invalid=2274, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 01:45:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35964 states. [2019-12-27 01:45:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35964 to 26046. [2019-12-27 01:45:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26046 states. [2019-12-27 01:45:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26046 states to 26046 states and 79590 transitions. [2019-12-27 01:45:18,738 INFO L78 Accepts]: Start accepts. Automaton has 26046 states and 79590 transitions. Word has length 66 [2019-12-27 01:45:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:18,738 INFO L462 AbstractCegarLoop]: Abstraction has 26046 states and 79590 transitions. [2019-12-27 01:45:18,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 01:45:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 26046 states and 79590 transitions. [2019-12-27 01:45:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:18,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:18,767 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:45:18,767 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:45:18,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash 539047833, now seen corresponding path program 2 times [2019-12-27 01:45:18,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:18,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452227764] [2019-12-27 01:45:18,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:45:18,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452227764] [2019-12-27 01:45:18,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:18,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:45:18,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860653937] [2019-12-27 01:45:18,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:45:18,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:45:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:45:18,946 INFO L87 Difference]: Start difference. First operand 26046 states and 79590 transitions. Second operand 11 states. [2019-12-27 01:45:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:20,180 INFO L93 Difference]: Finished difference Result 51134 states and 157299 transitions. [2019-12-27 01:45:20,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:45:20,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:45:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:20,248 INFO L225 Difference]: With dead ends: 51134 [2019-12-27 01:45:20,248 INFO L226 Difference]: Without dead ends: 48511 [2019-12-27 01:45:20,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:45:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48511 states. [2019-12-27 01:45:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48511 to 29591. [2019-12-27 01:45:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29591 states. [2019-12-27 01:45:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29591 states to 29591 states and 90368 transitions. [2019-12-27 01:45:21,124 INFO L78 Accepts]: Start accepts. Automaton has 29591 states and 90368 transitions. Word has length 66 [2019-12-27 01:45:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:21,124 INFO L462 AbstractCegarLoop]: Abstraction has 29591 states and 90368 transitions. [2019-12-27 01:45:21,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:45:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 29591 states and 90368 transitions. [2019-12-27 01:45:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:21,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:21,156 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:45:21,156 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:45:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash 824750475, now seen corresponding path program 3 times [2019-12-27 01:45:21,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:21,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483375668] [2019-12-27 01:45:21,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:21,589 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:45:21,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483375668] [2019-12-27 01:45:21,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:21,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 01:45:21,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545560722] [2019-12-27 01:45:21,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 01:45:21,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:21,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 01:45:21,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:45:21,591 INFO L87 Difference]: Start difference. First operand 29591 states and 90368 transitions. Second operand 15 states. [2019-12-27 01:45:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:26,665 INFO L93 Difference]: Finished difference Result 59305 states and 178457 transitions. [2019-12-27 01:45:26,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 01:45:26,668 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 01:45:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:26,740 INFO L225 Difference]: With dead ends: 59305 [2019-12-27 01:45:26,740 INFO L226 Difference]: Without dead ends: 51078 [2019-12-27 01:45:26,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=526, Invalid=2444, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 01:45:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51078 states. [2019-12-27 01:45:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51078 to 28330. [2019-12-27 01:45:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28330 states. [2019-12-27 01:45:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28330 states to 28330 states and 86656 transitions. [2019-12-27 01:45:27,318 INFO L78 Accepts]: Start accepts. Automaton has 28330 states and 86656 transitions. Word has length 66 [2019-12-27 01:45:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:27,318 INFO L462 AbstractCegarLoop]: Abstraction has 28330 states and 86656 transitions. [2019-12-27 01:45:27,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 01:45:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 28330 states and 86656 transitions. [2019-12-27 01:45:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:27,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:27,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:45:27,347 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:45:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash 38318619, now seen corresponding path program 4 times [2019-12-27 01:45:27,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:27,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498709960] [2019-12-27 01:45:27,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:27,497 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:45:27,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498709960] [2019-12-27 01:45:27,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:27,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:45:27,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418202636] [2019-12-27 01:45:27,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:45:27,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:27,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:45:27,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:45:27,501 INFO L87 Difference]: Start difference. First operand 28330 states and 86656 transitions. Second operand 11 states. [2019-12-27 01:45:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:28,832 INFO L93 Difference]: Finished difference Result 47190 states and 144074 transitions. [2019-12-27 01:45:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:45:28,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:45:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:28,887 INFO L225 Difference]: With dead ends: 47190 [2019-12-27 01:45:28,887 INFO L226 Difference]: Without dead ends: 40576 [2019-12-27 01:45:28,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:45:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40576 states. [2019-12-27 01:45:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40576 to 24040. [2019-12-27 01:45:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24040 states. [2019-12-27 01:45:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24040 states to 24040 states and 73605 transitions. [2019-12-27 01:45:29,350 INFO L78 Accepts]: Start accepts. Automaton has 24040 states and 73605 transitions. Word has length 66 [2019-12-27 01:45:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:29,350 INFO L462 AbstractCegarLoop]: Abstraction has 24040 states and 73605 transitions. [2019-12-27 01:45:29,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:45:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 24040 states and 73605 transitions. [2019-12-27 01:45:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:29,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:29,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, 1, 1, 1] [2019-12-27 01:45:29,380 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:45:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:29,380 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 5 times [2019-12-27 01:45:29,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:29,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301042978] [2019-12-27 01:45:29,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:29,530 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:45:29,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301042978] [2019-12-27 01:45:29,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:29,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:45:29,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86307424] [2019-12-27 01:45:29,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:45:29,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:29,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:45:29,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:45:29,533 INFO L87 Difference]: Start difference. First operand 24040 states and 73605 transitions. Second operand 12 states. [2019-12-27 01:45:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:30,623 INFO L93 Difference]: Finished difference Result 41035 states and 125558 transitions. [2019-12-27 01:45:30,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:45:30,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 01:45:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:30,682 INFO L225 Difference]: With dead ends: 41035 [2019-12-27 01:45:30,682 INFO L226 Difference]: Without dead ends: 40044 [2019-12-27 01:45:30,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:45:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40044 states. [2019-12-27 01:45:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40044 to 23372. [2019-12-27 01:45:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23372 states. [2019-12-27 01:45:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23372 states to 23372 states and 71766 transitions. [2019-12-27 01:45:31,144 INFO L78 Accepts]: Start accepts. Automaton has 23372 states and 71766 transitions. Word has length 66 [2019-12-27 01:45:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:31,144 INFO L462 AbstractCegarLoop]: Abstraction has 23372 states and 71766 transitions. [2019-12-27 01:45:31,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:45:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 23372 states and 71766 transitions. [2019-12-27 01:45:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:31,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:31,168 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:45:31,169 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:45:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:31,169 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 6 times [2019-12-27 01:45:31,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:31,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291777337] [2019-12-27 01:45:31,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:45:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:45:31,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:45:31,276 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:45:31,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t503~0.base_22|)) (= 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) (= 0 v_~z$r_buff0_thd3~0_377) (= v_~__unbuffered_cnt~0_128 0) (= v_~z$r_buff0_thd1~0_378 0) (= v_~z$mem_tmp~0_24 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t503~0.base_22| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_22|) |v_ULTIMATE.start_main_~#t503~0.offset_16| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd0~0_195 0) (= v_~y~0_28 0) (= v_~z$w_buff1_used~0_500 0) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$read_delayed~0_7 0) (= |v_ULTIMATE.start_main_~#t503~0.offset_16| 0) (= v_~z$r_buff0_thd2~0_182 0) (= 0 v_~z$r_buff1_thd3~0_396) (= 0 v_~x~0_245) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_35) (= v_~z$r_buff1_thd0~0_294 0) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t503~0.base_22|) (= v_~z$r_buff1_thd2~0_280 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t503~0.base_22| 1)) (= v_~z$w_buff1~0_199 0) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~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_72|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_195, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start_main_~#t503~0.base=|v_ULTIMATE.start_main_~#t503~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_17|, ~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|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_19|, ~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_377, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_245, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~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_38, 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_294, ~y~0=v_~y~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_182, 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, ULTIMATE.start_main_~#t503~0.offset=|v_ULTIMATE.start_main_~#t503~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_14|, #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_378} AuxVars[] AssignedVars[~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_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t503~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t505~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t504~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t505~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, ~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, ULTIMATE.start_main_~#t503~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t504~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:45:31,281 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_~x~0_11 1) (= 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)) 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, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~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_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~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, ~x~0] because there is no mapped edge [2019-12-27 01:45:31,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t504~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t504~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t504~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t504~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11|) |v_ULTIMATE.start_main_~#t504~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11| 1) |v_#valid_31|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t504~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t504~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 01:45:31,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t505~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12|) |v_ULTIMATE.start_main_~#t505~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t505~0.base_12| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t505~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t505~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_12|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t505~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t505~0.base, #length] because there is no mapped edge [2019-12-27 01:45:31,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In175253919 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In175253919 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out175253919| |P1Thread1of1ForFork2_#t~ite10_Out175253919|))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out175253919| ~z$w_buff1~0_In175253919) .cse2) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out175253919| ~z~0_In175253919) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In175253919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In175253919, ~z$w_buff1~0=~z$w_buff1~0_In175253919, ~z~0=~z~0_In175253919} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out175253919|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In175253919, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out175253919|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In175253919, ~z$w_buff1~0=~z$w_buff1~0_In175253919, ~z~0=~z~0_In175253919} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:45:31,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1656254157 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out-1656254157| |P2Thread1of1ForFork0_#t~ite24_Out-1656254157|) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-1656254157| ~z$w_buff1~0_In-1656254157) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1656254157 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1656254157 256))) (= (mod ~z$w_buff0_used~0_In-1656254157 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1656254157 256) 0))))) (and (= ~z$w_buff1~0_In-1656254157 |P2Thread1of1ForFork0_#t~ite24_Out-1656254157|) (= |P2Thread1of1ForFork0_#t~ite23_In-1656254157| |P2Thread1of1ForFork0_#t~ite23_Out-1656254157|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1656254157, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1656254157, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1656254157|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1656254157, ~z$w_buff1~0=~z$w_buff1~0_In-1656254157, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1656254157, ~weak$$choice2~0=~weak$$choice2~0_In-1656254157} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1656254157, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1656254157|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1656254157, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1656254157|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1656254157, ~z$w_buff1~0=~z$w_buff1~0_In-1656254157, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1656254157, ~weak$$choice2~0=~weak$$choice2~0_In-1656254157} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:45:31,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse4 (= 0 (mod ~z$w_buff1_used~0_In1273766265 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out1273766265| |P2Thread1of1ForFork0_#t~ite30_Out1273766265|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1273766265 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In1273766265 256))) (.cse5 (= 0 (mod ~z$w_buff0_used~0_In1273766265 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1273766265 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In1273766265| |P2Thread1of1ForFork0_#t~ite28_Out1273766265|) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out1273766265| |P2Thread1of1ForFork0_#t~ite29_In1273766265|) (not .cse0) (= ~z$w_buff1_used~0_In1273766265 |P2Thread1of1ForFork0_#t~ite30_Out1273766265|)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out1273766265| ~z$w_buff1_used~0_In1273766265) .cse1 (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5) .cse0))) (let ((.cse6 (not .cse3))) (and (or .cse6 (not .cse4)) .cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out1273766265| |P2Thread1of1ForFork0_#t~ite28_Out1273766265|) (or .cse6 (not .cse2)) .cse0 (not .cse5) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out1273766265|))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1273766265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1273766265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1273766265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1273766265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273766265, ~weak$$choice2~0=~weak$$choice2~0_In1273766265, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1273766265|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1273766265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1273766265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1273766265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1273766265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273766265, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1273766265|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1273766265|, ~weak$$choice2~0=~weak$$choice2~0_In1273766265} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:45:31,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_371 v_~z$r_buff0_thd3~0_370) (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, 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_370, 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:45:31,291 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:45:31,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-1291864321| |P2Thread1of1ForFork0_#t~ite38_Out-1291864321|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1291864321 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1291864321 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-1291864321| ~z~0_In-1291864321) (or .cse1 .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1291864321| ~z$w_buff1~0_In-1291864321) .cse0 (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1291864321, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1291864321, ~z$w_buff1~0=~z$w_buff1~0_In-1291864321, ~z~0=~z~0_In-1291864321} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1291864321|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1291864321|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1291864321, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1291864321, ~z$w_buff1~0=~z$w_buff1~0_In-1291864321, ~z~0=~z~0_In-1291864321} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:45:31,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1328363113 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1328363113 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1328363113| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1328363113| ~z$w_buff0_used~0_In1328363113)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1328363113, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1328363113} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1328363113, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1328363113|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1328363113} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:45:31,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1076984415 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1076984415 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1076984415 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1076984415 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-1076984415| ~z$w_buff1_used~0_In-1076984415) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1076984415| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1076984415, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1076984415, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1076984415, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1076984415} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1076984415, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1076984415, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1076984415, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1076984415, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1076984415|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:45:31,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-381995153 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-381995153 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-381995153| ~z$r_buff0_thd3~0_In-381995153)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-381995153| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-381995153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-381995153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-381995153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-381995153, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-381995153|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:45:31,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In851747003 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In851747003 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In851747003 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In851747003 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out851747003|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out851747003| ~z$r_buff1_thd3~0_In851747003)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In851747003, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In851747003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In851747003, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In851747003} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out851747003|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In851747003, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In851747003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In851747003, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In851747003} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:45:31,294 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_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_308 |v_P2Thread1of1ForFork0_#t~ite43_56|)) 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_308, ~__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:45:31,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1398088133 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1398088133 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1398088133| ~z$w_buff0_used~0_In-1398088133) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1398088133| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1398088133, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1398088133} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1398088133|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1398088133, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1398088133} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:45:31,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In348239015 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In348239015 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In348239015 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In348239015 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out348239015| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In348239015 |P0Thread1of1ForFork1_#t~ite6_Out348239015|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In348239015, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In348239015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In348239015, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In348239015} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In348239015, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out348239015|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In348239015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In348239015, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In348239015} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:45:31,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1264930112 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1264930112 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out1264930112 ~z$r_buff0_thd1~0_In1264930112) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1264930112 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1264930112, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1264930112} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1264930112, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1264930112|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1264930112} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:45:31,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-242587617 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-242587617 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-242587617 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-242587617 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-242587617| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-242587617| ~z$r_buff1_thd1~0_In-242587617) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-242587617, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-242587617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-242587617, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-242587617} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-242587617|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-242587617, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-242587617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-242587617, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-242587617} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:45:31,297 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:45:31,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1101084369 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1101084369 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1101084369| 0)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1101084369| ~z$w_buff0_used~0_In-1101084369) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1101084369, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1101084369} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1101084369, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1101084369|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1101084369} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:45:31,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1575953360 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1575953360 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1575953360 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1575953360 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1575953360| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out-1575953360| ~z$w_buff1_used~0_In-1575953360)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1575953360, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1575953360, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1575953360, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1575953360} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1575953360, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1575953360, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1575953360, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1575953360|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1575953360} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:45:31,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1375413774 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1375413774 256)))) (or (and (= ~z$r_buff0_thd2~0_In1375413774 |P1Thread1of1ForFork2_#t~ite13_Out1375413774|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1375413774|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1375413774, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1375413774} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1375413774, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1375413774|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1375413774} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:45:31,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-159295706 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-159295706 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-159295706 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-159295706 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-159295706| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-159295706| ~z$r_buff1_thd2~0_In-159295706) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-159295706, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-159295706, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-159295706, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-159295706} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-159295706, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-159295706, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-159295706, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-159295706|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-159295706} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:45:31,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= v_~z$r_buff1_thd2~0_188 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 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_188, ~__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:45:31,299 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:45:31,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2026030119 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2026030119 256)))) (or (and (= ~z$w_buff1~0_In2026030119 |ULTIMATE.start_main_#t~ite47_Out2026030119|) (not .cse0) (not .cse1)) (and (= ~z~0_In2026030119 |ULTIMATE.start_main_#t~ite47_Out2026030119|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2026030119, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2026030119, ~z$w_buff1~0=~z$w_buff1~0_In2026030119, ~z~0=~z~0_In2026030119} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2026030119, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2026030119|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2026030119, ~z$w_buff1~0=~z$w_buff1~0_In2026030119, ~z~0=~z~0_In2026030119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:45:31,300 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:45:31,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-382380242 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-382380242 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-382380242 |ULTIMATE.start_main_#t~ite49_Out-382380242|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-382380242|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-382380242, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-382380242} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-382380242, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-382380242, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-382380242|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:45:31,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In917411844 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In917411844 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In917411844 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In917411844 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out917411844| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out917411844| ~z$w_buff1_used~0_In917411844) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In917411844, ~z$w_buff0_used~0=~z$w_buff0_used~0_In917411844, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In917411844, ~z$w_buff1_used~0=~z$w_buff1_used~0_In917411844} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out917411844|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In917411844, ~z$w_buff0_used~0=~z$w_buff0_used~0_In917411844, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In917411844, ~z$w_buff1_used~0=~z$w_buff1_used~0_In917411844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:45:31,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1747459633 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1747459633 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1747459633|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1747459633 |ULTIMATE.start_main_#t~ite51_Out1747459633|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1747459633, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1747459633} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1747459633, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1747459633|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1747459633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:45:31,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-2125427612 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2125427612 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2125427612 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2125427612 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-2125427612 |ULTIMATE.start_main_#t~ite52_Out-2125427612|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-2125427612|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2125427612, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125427612, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2125427612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125427612} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2125427612|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2125427612, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125427612, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2125427612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125427612} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:45:31,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p1_EAX~0_22) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 2 v_~x~0_186)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186} OutVars{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, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186, 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:45:31,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:45:31 BasicIcfg [2019-12-27 01:45:31,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:45:31,421 INFO L168 Benchmark]: Toolchain (without parser) took 143503.13 ms. Allocated memory was 145.8 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 01:45:31,421 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:45:31,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.68 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 156.7 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:45:31,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.47 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 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:45:31,427 INFO L168 Benchmark]: Boogie Preprocessor took 40.80 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:45:31,427 INFO L168 Benchmark]: RCFGBuilder took 837.80 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:45:31,428 INFO L168 Benchmark]: TraceAbstraction took 141745.54 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:45:31,435 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.68 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 156.7 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.47 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.80 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.80 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141745.54 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7044 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 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(&t503, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_p1_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t504, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 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_p1_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=2, 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] [L829] FCALL, FORK 0 pthread_create(&t505, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, 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] [L780] 3 y = 1 [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, 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: 141.4s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 59.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9717 SDtfs, 12536 SDslu, 41098 SDs, 0 SdLazy, 35840 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 50 SyntacticMatches, 45 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4631 ImplicationChecksByTransitivity, 9.5s 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: 45.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 370096 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1677 NumberOfCodeBlocks, 1677 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1576 ConstructedInterpolants, 0 QuantifiedInterpolants, 435270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...