/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/safe021_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:53:45,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:53:45,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:53:45,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:53:45,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:53:45,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:53:45,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:53:45,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:53:45,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:53:45,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:53:45,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:53:45,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:53:45,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:53:45,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:53:45,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:53:45,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:53:45,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:53:45,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:53:45,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:53:45,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:53:45,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:53:45,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:53:45,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:53:45,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:53:45,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:53:45,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:53:45,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:53:45,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:53:45,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:53:45,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:53:45,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:53:45,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:53:45,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:53:45,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:53:45,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:53:45,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:53:45,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:53:45,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:53:45,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:53:45,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:53:45,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:53:45,686 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 03:53:45,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:53:45,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:53:45,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:53:45,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:53:45,714 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:53:45,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:53:45,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:53:45,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:53:45,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:53:45,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:53:45,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:53:45,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:53:45,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:53:45,717 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:53:45,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:53:45,717 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:53:45,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:53:45,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:53:45,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:53:45,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:53:45,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:53:45,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:53:45,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:53:45,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:53:45,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:53:45,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:53:45,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:53:45,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:53:45,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:53:46,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:53:46,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:53:46,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:53:46,052 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:53:46,052 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:53:46,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-27 03:53:46,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68adb3081/75b7c4ce44ae46098bf5c51c08e61339/FLAGed202cacc [2019-12-27 03:53:46,678 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:53:46,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-27 03:53:46,699 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68adb3081/75b7c4ce44ae46098bf5c51c08e61339/FLAGed202cacc [2019-12-27 03:53:46,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68adb3081/75b7c4ce44ae46098bf5c51c08e61339 [2019-12-27 03:53:46,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:53:46,977 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:53:46,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:53:46,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:53:46,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:53:46,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:53:46" (1/1) ... [2019-12-27 03:53:46,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd32435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:46, skipping insertion in model container [2019-12-27 03:53:46,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:53:46" (1/1) ... [2019-12-27 03:53:46,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:53:47,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:53:47,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:53:47,535 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:53:47,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:53:47,703 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:53:47,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47 WrapperNode [2019-12-27 03:53:47,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:53:47,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:53:47,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:53:47,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:53:47,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (1/1) ... [2019-12-27 03:53:47,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (1/1) ... [2019-12-27 03:53:47,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:53:47,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:53:47,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:53:47,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:53:47,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (1/1) ... [2019-12-27 03:53:47,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (1/1) ... [2019-12-27 03:53:47,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (1/1) ... [2019-12-27 03:53:47,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (1/1) ... [2019-12-27 03:53:47,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (1/1) ... [2019-12-27 03:53:47,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (1/1) ... [2019-12-27 03:53:47,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (1/1) ... [2019-12-27 03:53:47,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:53:47,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:53:47,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:53:47,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:53:47,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (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 03:53:47,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:53:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:53:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:53:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:53:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:53:47,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:53:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:53:47,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:53:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:53:47,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:53:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:53:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:53:47,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:53:47,888 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 03:53:48,661 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:53:48,661 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:53:48,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:53:48 BoogieIcfgContainer [2019-12-27 03:53:48,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:53:48,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:53:48,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:53:48,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:53:48,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:53:46" (1/3) ... [2019-12-27 03:53:48,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382b03d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:53:48, skipping insertion in model container [2019-12-27 03:53:48,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:47" (2/3) ... [2019-12-27 03:53:48,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382b03d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:53:48, skipping insertion in model container [2019-12-27 03:53:48,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:53:48" (3/3) ... [2019-12-27 03:53:48,672 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_pso.oepc.i [2019-12-27 03:53:48,682 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:53:48,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:53:48,691 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:53:48,692 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:53:48,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,755 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,763 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,764 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,810 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,810 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,810 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,813 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,813 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,818 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,820 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:53:48,844 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:53:48,865 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:53:48,865 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:53:48,865 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:53:48,865 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:53:48,865 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:53:48,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:53:48,866 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:53:48,866 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:53:48,883 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 03:53:48,885 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 03:53:48,992 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 03:53:48,993 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:53:49,010 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:53:49,035 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 03:53:49,091 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 03:53:49,091 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:53:49,099 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:53:49,121 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 03:53:49,122 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:53:54,896 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 03:53:55,031 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 03:53:55,415 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-27 03:53:55,415 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 03:53:55,419 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 03:54:14,310 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-27 03:54:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-27 03:54:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:54:14,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:14,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:54:14,319 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 03:54:14,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:14,325 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-27 03:54:14,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:14,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593336928] [2019-12-27 03:54:14,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:14,553 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 03:54:14,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593336928] [2019-12-27 03:54:14,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:14,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:54:14,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297732262] [2019-12-27 03:54:14,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:54:14,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:14,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:54:14,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:54:14,578 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-27 03:54:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:15,591 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-27 03:54:15,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:54:15,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:54:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:16,332 INFO L225 Difference]: With dead ends: 110910 [2019-12-27 03:54:16,332 INFO L226 Difference]: Without dead ends: 98066 [2019-12-27 03:54:16,334 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 03:54:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-27 03:54:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-27 03:54:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-27 03:54:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-27 03:54:29,645 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-27 03:54:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:29,646 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-27 03:54:29,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:54:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-27 03:54:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:54:29,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:29,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:54:29,657 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 03:54:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-27 03:54:29,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:29,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312762346] [2019-12-27 03:54:29,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:54:29,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312762346] [2019-12-27 03:54:29,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:29,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:54:29,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705477863] [2019-12-27 03:54:29,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:54:29,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:54:29,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:54:29,766 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-27 03:54:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:30,897 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-27 03:54:30,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:54:30,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:54:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:36,371 INFO L225 Difference]: With dead ends: 156656 [2019-12-27 03:54:36,371 INFO L226 Difference]: Without dead ends: 156558 [2019-12-27 03:54:36,372 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 03:54:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-27 03:54:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-27 03:54:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-27 03:54:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-27 03:54:44,403 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-27 03:54:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:44,404 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-27 03:54:44,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:54:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-27 03:54:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:54:44,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:44,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:54:44,408 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 03:54:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-27 03:54:44,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:44,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886482639] [2019-12-27 03:54:44,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:54:44,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886482639] [2019-12-27 03:54:44,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:44,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:54:44,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333489183] [2019-12-27 03:54:44,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:54:44,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:44,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:54:44,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:54:44,489 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-27 03:54:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:44,627 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-27 03:54:44,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:54:44,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:54:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:44,737 INFO L225 Difference]: With dead ends: 31386 [2019-12-27 03:54:44,737 INFO L226 Difference]: Without dead ends: 31386 [2019-12-27 03:54:44,738 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 03:54:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-27 03:54:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-27 03:54:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-27 03:54:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-27 03:54:50,032 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-27 03:54:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:50,033 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-27 03:54:50,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:54:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-27 03:54:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:54:50,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:50,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:54:50,036 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 03:54:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-27 03:54:50,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:50,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848882250] [2019-12-27 03:54:50,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:50,126 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 03:54:50,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848882250] [2019-12-27 03:54:50,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:50,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:54:50,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94811845] [2019-12-27 03:54:50,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:54:50,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:50,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:54:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:54:50,128 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-27 03:54:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:50,673 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-27 03:54:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:54:50,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 03:54:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:50,874 INFO L225 Difference]: With dead ends: 43205 [2019-12-27 03:54:50,874 INFO L226 Difference]: Without dead ends: 43205 [2019-12-27 03:54:50,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:54:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-27 03:54:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-27 03:54:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-27 03:54:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-27 03:54:51,667 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-27 03:54:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:51,668 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-27 03:54:51,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:54:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-27 03:54:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:54:51,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:51,678 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 03:54:51,679 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 03:54:51,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-27 03:54:51,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:51,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351666325] [2019-12-27 03:54:51,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:51,844 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 03:54:51,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351666325] [2019-12-27 03:54:51,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:51,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:54:51,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597649259] [2019-12-27 03:54:51,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:54:51,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:51,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:54:51,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:54:51,847 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-27 03:54:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:52,802 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-27 03:54:52,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:54:52,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:54:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:52,894 INFO L225 Difference]: With dead ends: 56051 [2019-12-27 03:54:52,894 INFO L226 Difference]: Without dead ends: 56037 [2019-12-27 03:54:52,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:54:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-27 03:54:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-27 03:54:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-27 03:54:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-27 03:54:54,040 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-27 03:54:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:54,041 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-27 03:54:54,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:54:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-27 03:54:54,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:54:54,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:54,056 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 03:54:54,057 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 03:54:54,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:54,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-27 03:54:54,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:54,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136150559] [2019-12-27 03:54:54,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:54,129 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 03:54:54,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136150559] [2019-12-27 03:54:54,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:54,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:54:54,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941168709] [2019-12-27 03:54:54,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:54:54,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:54,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:54:54,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:54:54,132 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-27 03:54:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:54,196 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-27 03:54:54,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:54:54,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:54:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:54,218 INFO L225 Difference]: With dead ends: 15281 [2019-12-27 03:54:54,218 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 03:54:54,219 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 03:54:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 03:54:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-27 03:54:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-27 03:54:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-27 03:54:54,459 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-27 03:54:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:54,459 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-27 03:54:54,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:54:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-27 03:54:54,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 03:54:54,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:54,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:54:54,471 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 03:54:54,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:54,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-27 03:54:54,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:54,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719112146] [2019-12-27 03:54:54,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:54,577 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 03:54:54,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719112146] [2019-12-27 03:54:54,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:54,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:54:54,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808399331] [2019-12-27 03:54:54,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:54:54,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:54,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:54:54,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:54:54,580 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-27 03:54:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:55,184 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-27 03:54:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:54:55,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 03:54:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:55,214 INFO L225 Difference]: With dead ends: 21679 [2019-12-27 03:54:55,214 INFO L226 Difference]: Without dead ends: 21679 [2019-12-27 03:54:55,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:54:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-27 03:54:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-27 03:54:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-27 03:54:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-27 03:54:55,514 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-27 03:54:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:55,514 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-27 03:54:55,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:54:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-27 03:54:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 03:54:55,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:55,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:54:55,532 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 03:54:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-27 03:54:55,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:55,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282183936] [2019-12-27 03:54:55,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:55,622 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 03:54:55,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282183936] [2019-12-27 03:54:55,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:55,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:54:55,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740504822] [2019-12-27 03:54:55,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:54:55,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:55,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:54:55,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:54:55,625 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-27 03:54:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:56,982 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-27 03:54:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 03:54:56,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 03:54:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:57,015 INFO L225 Difference]: With dead ends: 24589 [2019-12-27 03:54:57,015 INFO L226 Difference]: Without dead ends: 24589 [2019-12-27 03:54:57,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:54:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-27 03:54:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-27 03:54:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-27 03:54:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-27 03:54:57,331 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-27 03:54:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:57,331 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-27 03:54:57,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:54:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-27 03:54:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:54:57,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:57,354 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 03:54:57,355 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 03:54:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-27 03:54:57,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:57,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365464356] [2019-12-27 03:54:57,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:54:57,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365464356] [2019-12-27 03:54:57,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:57,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:54:57,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245477597] [2019-12-27 03:54:57,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:54:57,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:54:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:54:57,415 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-27 03:54:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:57,492 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-27 03:54:57,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:54:57,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 03:54:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:57,530 INFO L225 Difference]: With dead ends: 16665 [2019-12-27 03:54:57,530 INFO L226 Difference]: Without dead ends: 16665 [2019-12-27 03:54:57,531 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 03:54:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-27 03:54:57,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-27 03:54:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-27 03:54:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-27 03:54:57,930 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-27 03:54:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:57,930 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-27 03:54:57,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:54:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-27 03:54:57,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:54:57,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:57,958 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 03:54:57,959 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 03:54:57,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:57,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-27 03:54:57,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:57,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176298642] [2019-12-27 03:54:57,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:54:58,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176298642] [2019-12-27 03:54:58,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:58,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:54:58,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851972515] [2019-12-27 03:54:58,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:54:58,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:58,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:54:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:54:58,068 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-27 03:54:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:58,176 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-27 03:54:58,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:54:58,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 03:54:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:58,200 INFO L225 Difference]: With dead ends: 31503 [2019-12-27 03:54:58,201 INFO L226 Difference]: Without dead ends: 16332 [2019-12-27 03:54:58,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 03:54:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-27 03:54:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-27 03:54:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-27 03:54:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-27 03:54:58,450 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-27 03:54:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:58,450 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-27 03:54:58,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:54:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-27 03:54:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:54:58,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:58,470 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 03:54:58,470 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 03:54:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-27 03:54:58,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:58,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119169007] [2019-12-27 03:54:58,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:58,557 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 03:54:58,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119169007] [2019-12-27 03:54:58,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:58,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:54:58,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216356972] [2019-12-27 03:54:58,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:54:58,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:54:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:54:58,560 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 5 states. [2019-12-27 03:54:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:59,172 INFO L93 Difference]: Finished difference Result 22499 states and 66522 transitions. [2019-12-27 03:54:59,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:54:59,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 03:54:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:59,204 INFO L225 Difference]: With dead ends: 22499 [2019-12-27 03:54:59,204 INFO L226 Difference]: Without dead ends: 22499 [2019-12-27 03:54:59,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 03:54:59,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22499 states. [2019-12-27 03:54:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22499 to 21006. [2019-12-27 03:54:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21006 states. [2019-12-27 03:54:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 62454 transitions. [2019-12-27 03:54:59,665 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 62454 transitions. Word has length 40 [2019-12-27 03:54:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:54:59,665 INFO L462 AbstractCegarLoop]: Abstraction has 21006 states and 62454 transitions. [2019-12-27 03:54:59,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:54:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 62454 transitions. [2019-12-27 03:54:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:54:59,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:54:59,685 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 03:54:59,685 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 03:54:59,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:54:59,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1960596885, now seen corresponding path program 3 times [2019-12-27 03:54:59,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:54:59,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349776397] [2019-12-27 03:54:59,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:54:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:54:59,749 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 03:54:59,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349776397] [2019-12-27 03:54:59,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:54:59,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:54:59,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474369272] [2019-12-27 03:54:59,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:54:59,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:54:59,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:54:59,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:54:59,751 INFO L87 Difference]: Start difference. First operand 21006 states and 62454 transitions. Second operand 5 states. [2019-12-27 03:54:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:54:59,853 INFO L93 Difference]: Finished difference Result 19781 states and 59627 transitions. [2019-12-27 03:54:59,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:54:59,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 03:54:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:54:59,888 INFO L225 Difference]: With dead ends: 19781 [2019-12-27 03:54:59,888 INFO L226 Difference]: Without dead ends: 19287 [2019-12-27 03:54:59,889 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 03:54:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-27 03:55:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 18447. [2019-12-27 03:55:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-27 03:55:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56396 transitions. [2019-12-27 03:55:00,197 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56396 transitions. Word has length 40 [2019-12-27 03:55:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:00,197 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56396 transitions. [2019-12-27 03:55:00,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:55:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56396 transitions. [2019-12-27 03:55:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:00,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:00,219 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 03:55:00,220 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 03:55:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-27 03:55:00,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:00,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213307121] [2019-12-27 03:55:00,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:00,270 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 03:55:00,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213307121] [2019-12-27 03:55:00,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:00,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:55:00,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101258151] [2019-12-27 03:55:00,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:00,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:00,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:00,272 INFO L87 Difference]: Start difference. First operand 18447 states and 56396 transitions. Second operand 3 states. [2019-12-27 03:55:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:00,394 INFO L93 Difference]: Finished difference Result 27408 states and 83933 transitions. [2019-12-27 03:55:00,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:00,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 03:55:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:00,431 INFO L225 Difference]: With dead ends: 27408 [2019-12-27 03:55:00,431 INFO L226 Difference]: Without dead ends: 27408 [2019-12-27 03:55:00,432 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 03:55:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-12-27 03:55:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20833. [2019-12-27 03:55:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-27 03:55:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-27 03:55:00,801 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-27 03:55:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:00,801 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-27 03:55:00,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-27 03:55:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:00,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:00,833 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 03:55:00,833 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 03:55:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-27 03:55:00,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:00,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899139544] [2019-12-27 03:55:00,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:00,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899139544] [2019-12-27 03:55:00,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:00,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:55:00,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112920059] [2019-12-27 03:55:00,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:00,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:00,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:00,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:00,931 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-27 03:55:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:01,457 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-27 03:55:01,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:55:01,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:55:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:01,521 INFO L225 Difference]: With dead ends: 61323 [2019-12-27 03:55:01,521 INFO L226 Difference]: Without dead ends: 42147 [2019-12-27 03:55:01,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:55:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-27 03:55:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-27 03:55:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-27 03:55:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-27 03:55:02,320 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-27 03:55:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:02,320 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-27 03:55:02,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-27 03:55:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:02,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:02,352 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 03:55:02,352 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 03:55:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-27 03:55:02,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:02,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330340084] [2019-12-27 03:55:02,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:02,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330340084] [2019-12-27 03:55:02,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:02,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:55:02,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429197325] [2019-12-27 03:55:02,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:02,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:02,439 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-27 03:55:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:03,004 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-27 03:55:03,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:55:03,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:55:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:03,099 INFO L225 Difference]: With dead ends: 68574 [2019-12-27 03:55:03,099 INFO L226 Difference]: Without dead ends: 51641 [2019-12-27 03:55:03,099 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 03:55:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-27 03:55:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-27 03:55:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-27 03:55:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-27 03:55:03,798 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-27 03:55:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:03,799 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-27 03:55:03,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-27 03:55:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:03,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:03,835 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 03:55:03,835 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 03:55:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 3 times [2019-12-27 03:55:03,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:03,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741658771] [2019-12-27 03:55:03,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:03,943 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 03:55:03,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741658771] [2019-12-27 03:55:03,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:03,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:55:03,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769140014] [2019-12-27 03:55:03,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:03,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:03,946 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-27 03:55:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:04,419 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-27 03:55:04,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:55:04,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:55:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:04,498 INFO L225 Difference]: With dead ends: 58876 [2019-12-27 03:55:04,498 INFO L226 Difference]: Without dead ends: 51661 [2019-12-27 03:55:04,499 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 03:55:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-27 03:55:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-27 03:55:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-27 03:55:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-27 03:55:05,395 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-27 03:55:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:05,395 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-27 03:55:05,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-27 03:55:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:05,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:05,427 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 03:55:05,427 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 03:55:05,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-27 03:55:05,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:05,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59286459] [2019-12-27 03:55:05,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:05,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 03:55:05,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59286459] [2019-12-27 03:55:05,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:05,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:55:05,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416844377] [2019-12-27 03:55:05,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:05,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:05,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:05,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:05,500 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-27 03:55:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:05,749 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-27 03:55:05,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:05,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 03:55:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:05,835 INFO L225 Difference]: With dead ends: 33789 [2019-12-27 03:55:05,835 INFO L226 Difference]: Without dead ends: 33789 [2019-12-27 03:55:05,836 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 03:55:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-27 03:55:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-27 03:55:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-27 03:55:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-27 03:55:06,584 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-27 03:55:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:06,584 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-27 03:55:06,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-27 03:55:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:06,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:06,621 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 03:55:06,621 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 03:55:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-27 03:55:06,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:06,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858093046] [2019-12-27 03:55:06,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:06,675 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 03:55:06,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858093046] [2019-12-27 03:55:06,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:06,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:55:06,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713362994] [2019-12-27 03:55:06,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:55:06,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:06,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:55:06,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:55:06,677 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-27 03:55:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:07,148 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-27 03:55:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:55:07,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 03:55:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:07,244 INFO L225 Difference]: With dead ends: 45817 [2019-12-27 03:55:07,245 INFO L226 Difference]: Without dead ends: 45817 [2019-12-27 03:55:07,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 03:55:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-27 03:55:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-27 03:55:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-27 03:55:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-27 03:55:08,356 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-27 03:55:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:08,357 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-27 03:55:08,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:55:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-27 03:55:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:08,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:08,406 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 03:55:08,406 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 03:55:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-27 03:55:08,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:08,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284161353] [2019-12-27 03:55:08,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:08,493 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 03:55:08,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284161353] [2019-12-27 03:55:08,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:08,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:55:08,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131291696] [2019-12-27 03:55:08,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:08,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:08,495 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-27 03:55:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:09,054 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-27 03:55:09,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:55:09,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 03:55:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:09,156 INFO L225 Difference]: With dead ends: 69632 [2019-12-27 03:55:09,156 INFO L226 Difference]: Without dead ends: 63631 [2019-12-27 03:55:09,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:55:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-27 03:55:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-27 03:55:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-27 03:55:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-27 03:55:09,913 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-27 03:55:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:09,913 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-27 03:55:09,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-27 03:55:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:09,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:09,949 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 03:55:09,949 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 03:55:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-27 03:55:09,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:09,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172488169] [2019-12-27 03:55:09,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:10,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172488169] [2019-12-27 03:55:10,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:10,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:55:10,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516891164] [2019-12-27 03:55:10,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:10,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:10,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:10,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:10,056 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-27 03:55:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:10,849 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-27 03:55:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:55:10,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 03:55:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:10,918 INFO L225 Difference]: With dead ends: 44848 [2019-12-27 03:55:10,919 INFO L226 Difference]: Without dead ends: 44844 [2019-12-27 03:55:10,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:55:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-27 03:55:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-27 03:55:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-27 03:55:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-27 03:55:11,885 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-27 03:55:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:11,886 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-27 03:55:11,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-27 03:55:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:11,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:11,927 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 03:55:11,927 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 03:55:11,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-27 03:55:11,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:11,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831259170] [2019-12-27 03:55:11,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:11,968 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 03:55:11,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831259170] [2019-12-27 03:55:11,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:11,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:55:11,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824997055] [2019-12-27 03:55:11,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:11,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:11,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:11,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:11,970 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-27 03:55:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:12,362 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-27 03:55:12,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:12,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:55:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:12,470 INFO L225 Difference]: With dead ends: 43160 [2019-12-27 03:55:12,470 INFO L226 Difference]: Without dead ends: 43160 [2019-12-27 03:55:12,471 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 03:55:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-27 03:55:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-27 03:55:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-27 03:55:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-27 03:55:13,309 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-27 03:55:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:13,310 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-27 03:55:13,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-27 03:55:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:13,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:13,354 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 03:55:13,355 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 03:55:13,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:13,355 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-27 03:55:13,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:13,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587697326] [2019-12-27 03:55:13,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:13,443 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 03:55:13,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587697326] [2019-12-27 03:55:13,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:13,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:55:13,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562568853] [2019-12-27 03:55:13,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:13,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:13,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:13,447 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-27 03:55:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:14,062 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-27 03:55:14,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:55:14,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 03:55:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:14,146 INFO L225 Difference]: With dead ends: 52071 [2019-12-27 03:55:14,146 INFO L226 Difference]: Without dead ends: 52071 [2019-12-27 03:55:14,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:55:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-27 03:55:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-27 03:55:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-27 03:55:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-27 03:55:14,868 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-27 03:55:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:14,869 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-27 03:55:14,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-27 03:55:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:15,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:15,228 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 03:55:15,228 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 03:55:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-27 03:55:15,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:15,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455613157] [2019-12-27 03:55:15,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:15,293 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 03:55:15,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455613157] [2019-12-27 03:55:15,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:15,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:55:15,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081635969] [2019-12-27 03:55:15,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:55:15,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:15,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:55:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:55:15,295 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-27 03:55:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:15,480 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-27 03:55:15,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:55:15,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 03:55:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:15,528 INFO L225 Difference]: With dead ends: 33507 [2019-12-27 03:55:15,529 INFO L226 Difference]: Without dead ends: 33507 [2019-12-27 03:55:15,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:55:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-27 03:55:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-27 03:55:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-27 03:55:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-27 03:55:16,025 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-27 03:55:16,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:16,026 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-27 03:55:16,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:55:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-27 03:55:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:16,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:16,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:16,060 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 03:55:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-27 03:55:16,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:16,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931959930] [2019-12-27 03:55:16,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:16,133 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 03:55:16,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931959930] [2019-12-27 03:55:16,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:16,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:55:16,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960509448] [2019-12-27 03:55:16,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:55:16,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:16,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:55:16,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:55:16,135 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-27 03:55:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:16,796 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-27 03:55:16,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:55:16,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 03:55:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:16,894 INFO L225 Difference]: With dead ends: 40500 [2019-12-27 03:55:16,895 INFO L226 Difference]: Without dead ends: 40276 [2019-12-27 03:55:16,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 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 03:55:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-27 03:55:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-27 03:55:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-27 03:55:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-27 03:55:17,905 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-27 03:55:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:17,906 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-27 03:55:17,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:55:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-27 03:55:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:17,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:17,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:17,971 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 03:55:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-27 03:55:17,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:17,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732639072] [2019-12-27 03:55:17,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:18,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732639072] [2019-12-27 03:55:18,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:18,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:55:18,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653050264] [2019-12-27 03:55:18,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:55:18,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:55:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:55:18,156 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 8 states. [2019-12-27 03:55:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:19,518 INFO L93 Difference]: Finished difference Result 49096 states and 148270 transitions. [2019-12-27 03:55:19,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:55:19,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 03:55:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:19,600 INFO L225 Difference]: With dead ends: 49096 [2019-12-27 03:55:19,600 INFO L226 Difference]: Without dead ends: 49000 [2019-12-27 03:55:19,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:55:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49000 states. [2019-12-27 03:55:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49000 to 33469. [2019-12-27 03:55:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33469 states. [2019-12-27 03:55:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33469 states to 33469 states and 102034 transitions. [2019-12-27 03:55:20,493 INFO L78 Accepts]: Start accepts. Automaton has 33469 states and 102034 transitions. Word has length 65 [2019-12-27 03:55:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:20,494 INFO L462 AbstractCegarLoop]: Abstraction has 33469 states and 102034 transitions. [2019-12-27 03:55:20,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:55:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 33469 states and 102034 transitions. [2019-12-27 03:55:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:20,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:20,531 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 03:55:20,531 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 03:55:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-27 03:55:20,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:20,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146670467] [2019-12-27 03:55:20,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:20,704 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 03:55:20,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146670467] [2019-12-27 03:55:20,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:20,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:55:20,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401287721] [2019-12-27 03:55:20,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:55:20,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:20,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:55:20,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:55:20,707 INFO L87 Difference]: Start difference. First operand 33469 states and 102034 transitions. Second operand 11 states. [2019-12-27 03:55:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:23,552 INFO L93 Difference]: Finished difference Result 51780 states and 155567 transitions. [2019-12-27 03:55:23,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 03:55:23,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 03:55:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:23,629 INFO L225 Difference]: With dead ends: 51780 [2019-12-27 03:55:23,629 INFO L226 Difference]: Without dead ends: 51472 [2019-12-27 03:55:23,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 03:55:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51472 states. [2019-12-27 03:55:24,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51472 to 36360. [2019-12-27 03:55:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36360 states. [2019-12-27 03:55:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36360 states to 36360 states and 110560 transitions. [2019-12-27 03:55:24,337 INFO L78 Accepts]: Start accepts. Automaton has 36360 states and 110560 transitions. Word has length 65 [2019-12-27 03:55:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:24,338 INFO L462 AbstractCegarLoop]: Abstraction has 36360 states and 110560 transitions. [2019-12-27 03:55:24,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:55:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 36360 states and 110560 transitions. [2019-12-27 03:55:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:24,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:24,378 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 03:55:24,379 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 03:55:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1178106421, now seen corresponding path program 4 times [2019-12-27 03:55:24,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:24,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374857009] [2019-12-27 03:55:24,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:24,435 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 03:55:24,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374857009] [2019-12-27 03:55:24,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:24,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:55:24,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849875910] [2019-12-27 03:55:24,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:24,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:24,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:24,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:24,437 INFO L87 Difference]: Start difference. First operand 36360 states and 110560 transitions. Second operand 3 states. [2019-12-27 03:55:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:24,619 INFO L93 Difference]: Finished difference Result 36360 states and 110559 transitions. [2019-12-27 03:55:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:24,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:55:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:24,993 INFO L225 Difference]: With dead ends: 36360 [2019-12-27 03:55:24,994 INFO L226 Difference]: Without dead ends: 36360 [2019-12-27 03:55:24,994 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 03:55:25,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36360 states. [2019-12-27 03:55:25,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36360 to 29373. [2019-12-27 03:55:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29373 states. [2019-12-27 03:55:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29373 states to 29373 states and 91197 transitions. [2019-12-27 03:55:25,584 INFO L78 Accepts]: Start accepts. Automaton has 29373 states and 91197 transitions. Word has length 65 [2019-12-27 03:55:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:25,584 INFO L462 AbstractCegarLoop]: Abstraction has 29373 states and 91197 transitions. [2019-12-27 03:55:25,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 29373 states and 91197 transitions. [2019-12-27 03:55:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:55:25,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:25,620 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 03:55:25,620 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 03:55:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 1 times [2019-12-27 03:55:25,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:25,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931539152] [2019-12-27 03:55:25,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:25,804 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 03:55:25,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931539152] [2019-12-27 03:55:25,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:25,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:55:25,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618926602] [2019-12-27 03:55:25,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:55:25,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:55:25,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:55:25,806 INFO L87 Difference]: Start difference. First operand 29373 states and 91197 transitions. Second operand 11 states. [2019-12-27 03:55:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:27,786 INFO L93 Difference]: Finished difference Result 46019 states and 140289 transitions. [2019-12-27 03:55:27,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:55:27,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 03:55:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:27,854 INFO L225 Difference]: With dead ends: 46019 [2019-12-27 03:55:27,855 INFO L226 Difference]: Without dead ends: 46019 [2019-12-27 03:55:27,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 03:55:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46019 states. [2019-12-27 03:55:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46019 to 29884. [2019-12-27 03:55:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29884 states. [2019-12-27 03:55:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29884 states to 29884 states and 92931 transitions. [2019-12-27 03:55:28,480 INFO L78 Accepts]: Start accepts. Automaton has 29884 states and 92931 transitions. Word has length 66 [2019-12-27 03:55:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:28,481 INFO L462 AbstractCegarLoop]: Abstraction has 29884 states and 92931 transitions. [2019-12-27 03:55:28,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:55:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 29884 states and 92931 transitions. [2019-12-27 03:55:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:55:28,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:28,514 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 03:55:28,514 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 03:55:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash -353775189, now seen corresponding path program 2 times [2019-12-27 03:55:28,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:28,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296640415] [2019-12-27 03:55:28,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:28,570 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 03:55:28,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296640415] [2019-12-27 03:55:28,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:28,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:55:28,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566534980] [2019-12-27 03:55:28,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:28,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:28,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:28,572 INFO L87 Difference]: Start difference. First operand 29884 states and 92931 transitions. Second operand 3 states. [2019-12-27 03:55:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:28,673 INFO L93 Difference]: Finished difference Result 23659 states and 72294 transitions. [2019-12-27 03:55:28,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:28,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:55:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:28,705 INFO L225 Difference]: With dead ends: 23659 [2019-12-27 03:55:28,705 INFO L226 Difference]: Without dead ends: 23659 [2019-12-27 03:55:28,706 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 03:55:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23659 states. [2019-12-27 03:55:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23659 to 22516. [2019-12-27 03:55:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22516 states. [2019-12-27 03:55:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22516 states to 22516 states and 68726 transitions. [2019-12-27 03:55:29,361 INFO L78 Accepts]: Start accepts. Automaton has 22516 states and 68726 transitions. Word has length 66 [2019-12-27 03:55:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:29,362 INFO L462 AbstractCegarLoop]: Abstraction has 22516 states and 68726 transitions. [2019-12-27 03:55:29,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 22516 states and 68726 transitions. [2019-12-27 03:55:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:55:29,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:29,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:29,385 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 03:55:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-27 03:55:29,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:29,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703773799] [2019-12-27 03:55:29,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:29,951 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 03:55:29,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703773799] [2019-12-27 03:55:29,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:29,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:55:29,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940730712] [2019-12-27 03:55:29,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:55:29,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:29,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:55:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:55:29,953 INFO L87 Difference]: Start difference. First operand 22516 states and 68726 transitions. Second operand 16 states. [2019-12-27 03:55:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:33,157 INFO L93 Difference]: Finished difference Result 35330 states and 106275 transitions. [2019-12-27 03:55:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 03:55:33,158 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 03:55:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:33,201 INFO L225 Difference]: With dead ends: 35330 [2019-12-27 03:55:33,201 INFO L226 Difference]: Without dead ends: 30036 [2019-12-27 03:55:33,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 03:55:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30036 states. [2019-12-27 03:55:33,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30036 to 23232. [2019-12-27 03:55:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23232 states. [2019-12-27 03:55:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23232 states to 23232 states and 70547 transitions. [2019-12-27 03:55:33,611 INFO L78 Accepts]: Start accepts. Automaton has 23232 states and 70547 transitions. Word has length 67 [2019-12-27 03:55:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:33,612 INFO L462 AbstractCegarLoop]: Abstraction has 23232 states and 70547 transitions. [2019-12-27 03:55:33,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:55:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 23232 states and 70547 transitions. [2019-12-27 03:55:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:55:33,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:33,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:33,641 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 03:55:33,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:33,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1473001563, now seen corresponding path program 2 times [2019-12-27 03:55:33,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:33,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427438281] [2019-12-27 03:55:33,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:34,138 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 03:55:34,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427438281] [2019-12-27 03:55:34,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:34,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:55:34,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086130976] [2019-12-27 03:55:34,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:55:34,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:34,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:55:34,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:55:34,140 INFO L87 Difference]: Start difference. First operand 23232 states and 70547 transitions. Second operand 16 states. [2019-12-27 03:55:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:37,342 INFO L93 Difference]: Finished difference Result 32155 states and 96267 transitions. [2019-12-27 03:55:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 03:55:37,343 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 03:55:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:37,385 INFO L225 Difference]: With dead ends: 32155 [2019-12-27 03:55:37,385 INFO L226 Difference]: Without dead ends: 29618 [2019-12-27 03:55:37,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1820, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 03:55:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29618 states. [2019-12-27 03:55:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29618 to 23112. [2019-12-27 03:55:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23112 states. [2019-12-27 03:55:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23112 states to 23112 states and 70207 transitions. [2019-12-27 03:55:38,002 INFO L78 Accepts]: Start accepts. Automaton has 23112 states and 70207 transitions. Word has length 67 [2019-12-27 03:55:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:38,002 INFO L462 AbstractCegarLoop]: Abstraction has 23112 states and 70207 transitions. [2019-12-27 03:55:38,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:55:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 23112 states and 70207 transitions. [2019-12-27 03:55:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:55:38,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:38,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:38,028 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 03:55:38,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:38,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1816499453, now seen corresponding path program 3 times [2019-12-27 03:55:38,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:38,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832060922] [2019-12-27 03:55:38,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:38,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 03:55:38,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832060922] [2019-12-27 03:55:38,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:38,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:55:38,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913982473] [2019-12-27 03:55:38,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:55:38,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:55:38,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:55:38,531 INFO L87 Difference]: Start difference. First operand 23112 states and 70207 transitions. Second operand 16 states. [2019-12-27 03:55:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:41,492 INFO L93 Difference]: Finished difference Result 31968 states and 96381 transitions. [2019-12-27 03:55:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 03:55:41,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 03:55:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:41,529 INFO L225 Difference]: With dead ends: 31968 [2019-12-27 03:55:41,529 INFO L226 Difference]: Without dead ends: 26742 [2019-12-27 03:55:41,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 03:55:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26742 states. [2019-12-27 03:55:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26742 to 23706. [2019-12-27 03:55:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23706 states. [2019-12-27 03:55:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23706 states to 23706 states and 71714 transitions. [2019-12-27 03:55:41,907 INFO L78 Accepts]: Start accepts. Automaton has 23706 states and 71714 transitions. Word has length 67 [2019-12-27 03:55:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:41,907 INFO L462 AbstractCegarLoop]: Abstraction has 23706 states and 71714 transitions. [2019-12-27 03:55:41,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:55:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 23706 states and 71714 transitions. [2019-12-27 03:55:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:55:41,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:41,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:41,934 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 03:55:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1363751709, now seen corresponding path program 4 times [2019-12-27 03:55:41,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:41,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868951731] [2019-12-27 03:55:41,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:42,373 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 03:55:42,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868951731] [2019-12-27 03:55:42,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:42,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:55:42,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876263158] [2019-12-27 03:55:42,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:55:42,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:42,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:55:42,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:55:42,376 INFO L87 Difference]: Start difference. First operand 23706 states and 71714 transitions. Second operand 15 states. [2019-12-27 03:55:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:47,370 INFO L93 Difference]: Finished difference Result 54823 states and 165918 transitions. [2019-12-27 03:55:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 03:55:47,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 03:55:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:47,448 INFO L225 Difference]: With dead ends: 54823 [2019-12-27 03:55:47,448 INFO L226 Difference]: Without dead ends: 52608 [2019-12-27 03:55:47,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 03:55:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52608 states. [2019-12-27 03:55:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52608 to 28800. [2019-12-27 03:55:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28800 states. [2019-12-27 03:55:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28800 states to 28800 states and 87720 transitions. [2019-12-27 03:55:48,070 INFO L78 Accepts]: Start accepts. Automaton has 28800 states and 87720 transitions. Word has length 67 [2019-12-27 03:55:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:48,071 INFO L462 AbstractCegarLoop]: Abstraction has 28800 states and 87720 transitions. [2019-12-27 03:55:48,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:55:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28800 states and 87720 transitions. [2019-12-27 03:55:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:55:48,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:48,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:48,105 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 03:55:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:48,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1554321141, now seen corresponding path program 5 times [2019-12-27 03:55:48,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:48,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989938101] [2019-12-27 03:55:48,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:48,529 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 03:55:48,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989938101] [2019-12-27 03:55:48,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:48,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:55:48,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524651518] [2019-12-27 03:55:48,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:55:48,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:48,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:55:48,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:55:48,531 INFO L87 Difference]: Start difference. First operand 28800 states and 87720 transitions. Second operand 16 states. [2019-12-27 03:55:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:52,012 INFO L93 Difference]: Finished difference Result 42369 states and 126931 transitions. [2019-12-27 03:55:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 03:55:52,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 03:55:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:52,062 INFO L225 Difference]: With dead ends: 42369 [2019-12-27 03:55:52,062 INFO L226 Difference]: Without dead ends: 34789 [2019-12-27 03:55:52,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=404, Invalid=1948, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 03:55:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34789 states. [2019-12-27 03:55:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34789 to 26615. [2019-12-27 03:55:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26615 states. [2019-12-27 03:55:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26615 states to 26615 states and 80711 transitions. [2019-12-27 03:55:52,520 INFO L78 Accepts]: Start accepts. Automaton has 26615 states and 80711 transitions. Word has length 67 [2019-12-27 03:55:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:52,520 INFO L462 AbstractCegarLoop]: Abstraction has 26615 states and 80711 transitions. [2019-12-27 03:55:52,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:55:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 26615 states and 80711 transitions. [2019-12-27 03:55:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:55:52,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:52,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:52,548 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 03:55:52,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1885964539, now seen corresponding path program 6 times [2019-12-27 03:55:52,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:52,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618969614] [2019-12-27 03:55:52,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:53,137 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 03:55:53,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618969614] [2019-12-27 03:55:53,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:53,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 03:55:53,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017673090] [2019-12-27 03:55:53,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 03:55:53,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:53,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 03:55:53,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:55:53,139 INFO L87 Difference]: Start difference. First operand 26615 states and 80711 transitions. Second operand 17 states. [2019-12-27 03:55:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:56,197 INFO L93 Difference]: Finished difference Result 39032 states and 116978 transitions. [2019-12-27 03:55:56,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 03:55:56,198 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 03:55:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:56,245 INFO L225 Difference]: With dead ends: 39032 [2019-12-27 03:55:56,246 INFO L226 Difference]: Without dead ends: 34356 [2019-12-27 03:55:56,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=1456, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 03:55:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34356 states. [2019-12-27 03:55:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34356 to 26807. [2019-12-27 03:55:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-27 03:55:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81196 transitions. [2019-12-27 03:55:56,668 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81196 transitions. Word has length 67 [2019-12-27 03:55:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:56,668 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81196 transitions. [2019-12-27 03:55:56,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 03:55:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81196 transitions. [2019-12-27 03:55:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:55:56,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:56,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:56,698 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 03:55:56,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:56,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1956255013, now seen corresponding path program 7 times [2019-12-27 03:55:56,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:56,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787264467] [2019-12-27 03:55:56,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:57,147 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 03:55:57,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787264467] [2019-12-27 03:55:57,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:57,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 03:55:57,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168417401] [2019-12-27 03:55:57,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 03:55:57,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 03:55:57,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:55:57,149 INFO L87 Difference]: Start difference. First operand 26807 states and 81196 transitions. Second operand 17 states. [2019-12-27 03:56:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:00,191 INFO L93 Difference]: Finished difference Result 37552 states and 112024 transitions. [2019-12-27 03:56:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 03:56:00,192 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 03:56:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:00,243 INFO L225 Difference]: With dead ends: 37552 [2019-12-27 03:56:00,243 INFO L226 Difference]: Without dead ends: 35159 [2019-12-27 03:56:00,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 03:56:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35159 states. [2019-12-27 03:56:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35159 to 26741. [2019-12-27 03:56:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26741 states. [2019-12-27 03:56:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26741 states to 26741 states and 81003 transitions. [2019-12-27 03:56:00,720 INFO L78 Accepts]: Start accepts. Automaton has 26741 states and 81003 transitions. Word has length 67 [2019-12-27 03:56:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:00,720 INFO L462 AbstractCegarLoop]: Abstraction has 26741 states and 81003 transitions. [2019-12-27 03:56:00,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 03:56:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 26741 states and 81003 transitions. [2019-12-27 03:56:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:00,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:00,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:00,750 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:00,750 INFO L82 PathProgramCache]: Analyzing trace with hash 906207195, now seen corresponding path program 8 times [2019-12-27 03:56:00,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:00,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135138048] [2019-12-27 03:56:00,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:01,764 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 03:56:01,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135138048] [2019-12-27 03:56:01,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:01,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 03:56:01,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134594359] [2019-12-27 03:56:01,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 03:56:01,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 03:56:01,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:56:01,766 INFO L87 Difference]: Start difference. First operand 26741 states and 81003 transitions. Second operand 19 states. [2019-12-27 03:56:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:05,490 INFO L93 Difference]: Finished difference Result 33650 states and 100958 transitions. [2019-12-27 03:56:05,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 03:56:05,490 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 03:56:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:05,535 INFO L225 Difference]: With dead ends: 33650 [2019-12-27 03:56:05,536 INFO L226 Difference]: Without dead ends: 31421 [2019-12-27 03:56:05,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=419, Invalid=2337, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 03:56:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31421 states. [2019-12-27 03:56:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31421 to 26721. [2019-12-27 03:56:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26721 states. [2019-12-27 03:56:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26721 states to 26721 states and 80940 transitions. [2019-12-27 03:56:05,966 INFO L78 Accepts]: Start accepts. Automaton has 26721 states and 80940 transitions. Word has length 67 [2019-12-27 03:56:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:05,966 INFO L462 AbstractCegarLoop]: Abstraction has 26721 states and 80940 transitions. [2019-12-27 03:56:05,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 03:56:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 26721 states and 80940 transitions. [2019-12-27 03:56:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:05,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:05,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:05,994 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash -903618105, now seen corresponding path program 9 times [2019-12-27 03:56:05,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:05,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789037629] [2019-12-27 03:56:05,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:06,364 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 03:56:06,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789037629] [2019-12-27 03:56:06,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:06,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:56:06,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432474248] [2019-12-27 03:56:06,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:56:06,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:06,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:56:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:56:06,366 INFO L87 Difference]: Start difference. First operand 26721 states and 80940 transitions. Second operand 15 states. [2019-12-27 03:56:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:11,423 INFO L93 Difference]: Finished difference Result 50213 states and 151376 transitions. [2019-12-27 03:56:11,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 03:56:11,423 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 03:56:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:11,498 INFO L225 Difference]: With dead ends: 50213 [2019-12-27 03:56:11,498 INFO L226 Difference]: Without dead ends: 49446 [2019-12-27 03:56:11,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=505, Invalid=2687, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 03:56:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49446 states. [2019-12-27 03:56:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49446 to 27133. [2019-12-27 03:56:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27133 states. [2019-12-27 03:56:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27133 states to 27133 states and 82177 transitions. [2019-12-27 03:56:12,316 INFO L78 Accepts]: Start accepts. Automaton has 27133 states and 82177 transitions. Word has length 67 [2019-12-27 03:56:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:12,316 INFO L462 AbstractCegarLoop]: Abstraction has 27133 states and 82177 transitions. [2019-12-27 03:56:12,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:56:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27133 states and 82177 transitions. [2019-12-27 03:56:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:12,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:12,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:12,348 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:12,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2014454745, now seen corresponding path program 10 times [2019-12-27 03:56:12,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:12,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568436701] [2019-12-27 03:56:12,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:12,691 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 03:56:12,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568436701] [2019-12-27 03:56:12,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:12,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:56:12,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281381568] [2019-12-27 03:56:12,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:56:12,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:12,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:56:12,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:56:12,693 INFO L87 Difference]: Start difference. First operand 27133 states and 82177 transitions. Second operand 15 states. [2019-12-27 03:56:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:16,538 INFO L93 Difference]: Finished difference Result 48999 states and 147054 transitions. [2019-12-27 03:56:16,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 03:56:16,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 03:56:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:16,596 INFO L225 Difference]: With dead ends: 48999 [2019-12-27 03:56:16,596 INFO L226 Difference]: Without dead ends: 40866 [2019-12-27 03:56:16,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=526, Invalid=2444, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 03:56:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40866 states. [2019-12-27 03:56:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40866 to 22754. [2019-12-27 03:56:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22754 states. [2019-12-27 03:56:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22754 states to 22754 states and 68970 transitions. [2019-12-27 03:56:17,054 INFO L78 Accepts]: Start accepts. Automaton has 22754 states and 68970 transitions. Word has length 67 [2019-12-27 03:56:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:17,054 INFO L462 AbstractCegarLoop]: Abstraction has 22754 states and 68970 transitions. [2019-12-27 03:56:17,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:56:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 22754 states and 68970 transitions. [2019-12-27 03:56:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:17,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:17,077 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:17,077 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:17,077 INFO L82 PathProgramCache]: Analyzing trace with hash -413434747, now seen corresponding path program 11 times [2019-12-27 03:56:17,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:17,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128282478] [2019-12-27 03:56:17,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:17,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 03:56:17,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128282478] [2019-12-27 03:56:17,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:17,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:56:17,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379157907] [2019-12-27 03:56:17,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:56:17,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:56:17,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:56:17,196 INFO L87 Difference]: Start difference. First operand 22754 states and 68970 transitions. Second operand 9 states. [2019-12-27 03:56:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:18,412 INFO L93 Difference]: Finished difference Result 36285 states and 109179 transitions. [2019-12-27 03:56:18,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:56:18,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 03:56:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:18,456 INFO L225 Difference]: With dead ends: 36285 [2019-12-27 03:56:18,457 INFO L226 Difference]: Without dead ends: 30194 [2019-12-27 03:56:18,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:56:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30194 states. [2019-12-27 03:56:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30194 to 22604. [2019-12-27 03:56:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22604 states. [2019-12-27 03:56:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22604 states to 22604 states and 68470 transitions. [2019-12-27 03:56:19,015 INFO L78 Accepts]: Start accepts. Automaton has 22604 states and 68470 transitions. Word has length 67 [2019-12-27 03:56:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:19,015 INFO L462 AbstractCegarLoop]: Abstraction has 22604 states and 68470 transitions. [2019-12-27 03:56:19,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:56:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 22604 states and 68470 transitions. [2019-12-27 03:56:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:19,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:19,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:19,043 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1770318001, now seen corresponding path program 12 times [2019-12-27 03:56:19,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:19,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865093368] [2019-12-27 03:56:19,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:19,209 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 03:56:19,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865093368] [2019-12-27 03:56:19,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:19,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:56:19,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672993884] [2019-12-27 03:56:19,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:56:19,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:19,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:56:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:56:19,212 INFO L87 Difference]: Start difference. First operand 22604 states and 68470 transitions. Second operand 11 states. [2019-12-27 03:56:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:20,322 INFO L93 Difference]: Finished difference Result 41008 states and 125013 transitions. [2019-12-27 03:56:20,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 03:56:20,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 03:56:20,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:20,380 INFO L225 Difference]: With dead ends: 41008 [2019-12-27 03:56:20,380 INFO L226 Difference]: Without dead ends: 39093 [2019-12-27 03:56:20,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-27 03:56:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39093 states. [2019-12-27 03:56:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39093 to 24846. [2019-12-27 03:56:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24846 states. [2019-12-27 03:56:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24846 states to 24846 states and 75544 transitions. [2019-12-27 03:56:20,887 INFO L78 Accepts]: Start accepts. Automaton has 24846 states and 75544 transitions. Word has length 67 [2019-12-27 03:56:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:20,887 INFO L462 AbstractCegarLoop]: Abstraction has 24846 states and 75544 transitions. [2019-12-27 03:56:20,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:56:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 24846 states and 75544 transitions. [2019-12-27 03:56:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:20,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:20,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:20,916 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash 607615187, now seen corresponding path program 13 times [2019-12-27 03:56:20,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:20,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211412523] [2019-12-27 03:56:20,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:21,050 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 03:56:21,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211412523] [2019-12-27 03:56:21,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:21,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:56:21,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9506347] [2019-12-27 03:56:21,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:56:21,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:56:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:56:21,051 INFO L87 Difference]: Start difference. First operand 24846 states and 75544 transitions. Second operand 11 states. [2019-12-27 03:56:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:21,933 INFO L93 Difference]: Finished difference Result 39671 states and 120407 transitions. [2019-12-27 03:56:21,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 03:56:21,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 03:56:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:21,983 INFO L225 Difference]: With dead ends: 39671 [2019-12-27 03:56:21,983 INFO L226 Difference]: Without dead ends: 34519 [2019-12-27 03:56:21,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-27 03:56:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34519 states. [2019-12-27 03:56:22,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34519 to 21770. [2019-12-27 03:56:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21770 states. [2019-12-27 03:56:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21770 states to 21770 states and 66005 transitions. [2019-12-27 03:56:22,405 INFO L78 Accepts]: Start accepts. Automaton has 21770 states and 66005 transitions. Word has length 67 [2019-12-27 03:56:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:22,405 INFO L462 AbstractCegarLoop]: Abstraction has 21770 states and 66005 transitions. [2019-12-27 03:56:22,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:56:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 21770 states and 66005 transitions. [2019-12-27 03:56:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:22,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:22,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:22,427 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 14 times [2019-12-27 03:56:22,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:22,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403247663] [2019-12-27 03:56:22,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:56:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:56:22,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:56:22,534 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:56:22,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= 0 v_~__unbuffered_p2_EAX~0_45) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26|)) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26| 1)) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2287~0.base_26|) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26|) |v_ULTIMATE.start_main_~#t2287~0.offset_19| 0))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2287~0.base_26| 4)) (= 0 |v_ULTIMATE.start_main_~#t2287~0.offset_19|) (= v_~z$r_buff1_thd0~0_133 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ULTIMATE.start_main_~#t2287~0.base=|v_ULTIMATE.start_main_~#t2287~0.base_26|, ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_19|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2287~0.offset=|v_ULTIMATE.start_main_~#t2287~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ULTIMATE.start_main_~#t2289~0.offset, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2288~0.offset, ULTIMATE.start_main_~#t2289~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~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_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2287~0.base, #NULL.base, ULTIMATE.start_main_~#t2287~0.offset, ULTIMATE.start_main_~#t2288~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 03:56:22,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2288~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2288~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9|) |v_ULTIMATE.start_main_~#t2288~0.offset_8| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2288~0.offset_8|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2288~0.offset] because there is no mapped edge [2019-12-27 03:56:22,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In-1558477640 ~z$w_buff1~0_Out-1558477640) (= |P0Thread1of1ForFork0_#in~arg.base_In-1558477640| P0Thread1of1ForFork0_~arg.base_Out-1558477640) (= 1 ~z$w_buff0~0_Out-1558477640) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1558477640| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1558477640) (= ~z$w_buff1_used~0_Out-1558477640 ~z$w_buff0_used~0_In-1558477640) (= ~z$w_buff0_used~0_Out-1558477640 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1558477640| P0Thread1of1ForFork0_~arg.offset_Out-1558477640) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1558477640| 1) (= 0 (mod ~z$w_buff1_used~0_Out-1558477640 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1558477640|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1558477640, ~z$w_buff0~0=~z$w_buff0~0_In-1558477640, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1558477640|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1558477640|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1558477640, ~z$w_buff0~0=~z$w_buff0~0_Out-1558477640, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1558477640, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1558477640, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1558477640|, ~z$w_buff1~0=~z$w_buff1~0_Out-1558477640, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1558477640, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1558477640|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1558477640} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 03:56:22,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11|) |v_ULTIMATE.start_main_~#t2289~0.offset_9| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2289~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2289~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2289~0.offset, #length, ULTIMATE.start_main_~#t2289~0.base] because there is no mapped edge [2019-12-27 03:56:22,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In39892155 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out39892155| |P1Thread1of1ForFork1_#t~ite9_Out39892155|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In39892155 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out39892155| ~z~0_In39892155) (or .cse0 .cse1) .cse2) (and (= ~z$w_buff1~0_In39892155 |P1Thread1of1ForFork1_#t~ite9_Out39892155|) (not .cse0) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In39892155, ~z$w_buff1_used~0=~z$w_buff1_used~0_In39892155, ~z$w_buff1~0=~z$w_buff1~0_In39892155, ~z~0=~z~0_In39892155} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out39892155|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In39892155, ~z$w_buff1_used~0=~z$w_buff1_used~0_In39892155, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out39892155|, ~z$w_buff1~0=~z$w_buff1~0_In39892155, ~z~0=~z~0_In39892155} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 03:56:22,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In310672311 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In310672311 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In310672311 |P1Thread1of1ForFork1_#t~ite11_Out310672311|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out310672311|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In310672311, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In310672311} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In310672311, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out310672311|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In310672311} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:56:22,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1242822770 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1242822770 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1242822770 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1242822770 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1242822770| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1242822770 |P1Thread1of1ForFork1_#t~ite12_Out1242822770|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1242822770, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1242822770, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1242822770, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1242822770} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1242822770, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1242822770, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1242822770, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1242822770|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1242822770} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:56:22,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1571536244 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1571536244 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1571536244| ~z$r_buff0_thd2~0_In1571536244)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1571536244| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1571536244, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1571536244} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1571536244, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1571536244|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1571536244} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:56:22,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1682944807 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_Out1682944807| |P2Thread1of1ForFork2_#t~ite24_Out1682944807|) (= ~z$w_buff1~0_In1682944807 |P2Thread1of1ForFork2_#t~ite23_Out1682944807|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1682944807 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1682944807 256)) (and (= 0 (mod ~z$w_buff1_used~0_In1682944807 256)) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1682944807 256)) .cse0))) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite23_In1682944807| |P2Thread1of1ForFork2_#t~ite23_Out1682944807|) (= ~z$w_buff1~0_In1682944807 |P2Thread1of1ForFork2_#t~ite24_Out1682944807|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1682944807|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1682944807, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1682944807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1682944807, ~z$w_buff1~0=~z$w_buff1~0_In1682944807, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1682944807, ~weak$$choice2~0=~weak$$choice2~0_In1682944807} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1682944807|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1682944807|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1682944807, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1682944807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1682944807, ~z$w_buff1~0=~z$w_buff1~0_In1682944807, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1682944807, ~weak$$choice2~0=~weak$$choice2~0_In1682944807} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 03:56:22,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-755176662 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_In-755176662| |P2Thread1of1ForFork2_#t~ite26_Out-755176662|) (= ~z$w_buff0_used~0_In-755176662 |P2Thread1of1ForFork2_#t~ite27_Out-755176662|) (not .cse0)) (and (= ~z$w_buff0_used~0_In-755176662 |P2Thread1of1ForFork2_#t~ite26_Out-755176662|) (= |P2Thread1of1ForFork2_#t~ite26_Out-755176662| |P2Thread1of1ForFork2_#t~ite27_Out-755176662|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-755176662 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-755176662 256) 0)) (= (mod ~z$w_buff0_used~0_In-755176662 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-755176662 256))))) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-755176662|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-755176662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755176662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755176662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755176662, ~weak$$choice2~0=~weak$$choice2~0_In-755176662} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-755176662|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-755176662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755176662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755176662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755176662, ~weak$$choice2~0=~weak$$choice2~0_In-755176662, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-755176662|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 03:56:22,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-480446535 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-480446535 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-480446535 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-480446535 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-480446535| ~z$r_buff1_thd2~0_In-480446535) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-480446535| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-480446535, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-480446535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-480446535, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-480446535} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-480446535, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-480446535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-480446535, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-480446535|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-480446535} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:56:22,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:56:22,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-283491662 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-283491662 256)))) (or (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-283491662 256) 0)) (and (= 0 (mod ~z$w_buff1_used~0_In-283491662 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-283491662 256)))) .cse1 (= ~z$w_buff1_used~0_In-283491662 |P2Thread1of1ForFork2_#t~ite29_Out-283491662|) (= |P2Thread1of1ForFork2_#t~ite30_Out-283491662| |P2Thread1of1ForFork2_#t~ite29_Out-283491662|)) (and (not .cse1) (= ~z$w_buff1_used~0_In-283491662 |P2Thread1of1ForFork2_#t~ite30_Out-283491662|) (= |P2Thread1of1ForFork2_#t~ite29_In-283491662| |P2Thread1of1ForFork2_#t~ite29_Out-283491662|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-283491662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-283491662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-283491662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-283491662, ~weak$$choice2~0=~weak$$choice2~0_In-283491662, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-283491662|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-283491662|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-283491662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-283491662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-283491662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-283491662, ~weak$$choice2~0=~weak$$choice2~0_In-283491662, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-283491662|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 03:56:22,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 03:56:22,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 03:56:22,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In276248816 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In276248816 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out276248816| ~z$w_buff0_used~0_In276248816) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out276248816| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In276248816, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In276248816} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out276248816|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In276248816, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In276248816} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:56:22,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1206542505 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1206542505 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1206542505 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1206542505 256) 0))) (or (and (= ~z$w_buff1_used~0_In1206542505 |P0Thread1of1ForFork0_#t~ite6_Out1206542505|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out1206542505| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1206542505, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1206542505, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1206542505, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1206542505} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1206542505|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1206542505, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1206542505, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1206542505, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1206542505} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:56:22,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1740821713 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1740821713 256)))) (or (and (= ~z$r_buff0_thd1~0_Out1740821713 ~z$r_buff0_thd1~0_In1740821713) (or .cse0 .cse1)) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out1740821713 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1740821713, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1740821713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1740821713, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1740821713|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1740821713} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:56:22,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2002630720 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-2002630720 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-2002630720 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2002630720 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-2002630720| ~z$r_buff1_thd1~0_In-2002630720) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-2002630720| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002630720, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2002630720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002630720, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2002630720} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002630720, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2002630720|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2002630720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002630720, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2002630720} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:56:22,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:56:22,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-480728549| |P2Thread1of1ForFork2_#t~ite39_Out-480728549|)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-480728549 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-480728549 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out-480728549| ~z$w_buff1~0_In-480728549)) (and .cse0 (= ~z~0_In-480728549 |P2Thread1of1ForFork2_#t~ite38_Out-480728549|) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-480728549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-480728549, ~z$w_buff1~0=~z$w_buff1~0_In-480728549, ~z~0=~z~0_In-480728549} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-480728549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-480728549, ~z$w_buff1~0=~z$w_buff1~0_In-480728549, ~z~0=~z~0_In-480728549, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-480728549|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-480728549|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 03:56:22,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-760269232 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-760269232 256) 0))) (or (and (= ~z$w_buff0_used~0_In-760269232 |P2Thread1of1ForFork2_#t~ite40_Out-760269232|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-760269232|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-760269232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-760269232} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-760269232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-760269232, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-760269232|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 03:56:22,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-603976258 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-603976258 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-603976258 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-603976258 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-603976258|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-603976258 |P2Thread1of1ForFork2_#t~ite41_Out-603976258|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-603976258, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-603976258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-603976258, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-603976258} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-603976258|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-603976258, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-603976258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-603976258, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-603976258} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 03:56:22,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-362960673 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-362960673 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-362960673| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-362960673| ~z$r_buff0_thd3~0_In-362960673)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-362960673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-362960673} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-362960673|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-362960673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-362960673} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 03:56:22,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In394485828 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In394485828 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In394485828 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In394485828 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out394485828| ~z$r_buff1_thd3~0_In394485828) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out394485828|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In394485828, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In394485828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In394485828, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In394485828} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In394485828, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In394485828, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out394485828|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In394485828, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In394485828} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 03:56:22,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 03:56:22,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:56:22,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out717642558| |ULTIMATE.start_main_#t~ite47_Out717642558|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In717642558 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In717642558 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out717642558| ~z~0_In717642558)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In717642558 |ULTIMATE.start_main_#t~ite47_Out717642558|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In717642558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In717642558, ~z$w_buff1~0=~z$w_buff1~0_In717642558, ~z~0=~z~0_In717642558} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In717642558, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out717642558|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In717642558, ~z$w_buff1~0=~z$w_buff1~0_In717642558, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out717642558|, ~z~0=~z~0_In717642558} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:56:22,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1426865004 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1426865004 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1426865004|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1426865004 |ULTIMATE.start_main_#t~ite49_Out1426865004|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1426865004, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1426865004} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1426865004, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1426865004, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1426865004|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 03:56:22,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1855930481 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1855930481 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1855930481 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1855930481 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1855930481 |ULTIMATE.start_main_#t~ite50_Out1855930481|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1855930481|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1855930481, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1855930481, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1855930481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1855930481} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1855930481|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1855930481, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1855930481, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1855930481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1855930481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 03:56:22,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1619871676 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1619871676 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1619871676 |ULTIMATE.start_main_#t~ite51_Out1619871676|)) (and (= |ULTIMATE.start_main_#t~ite51_Out1619871676| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1619871676, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1619871676} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1619871676, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1619871676|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1619871676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 03:56:22,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-319805130 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-319805130 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-319805130 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-319805130 256)))) (or (and (= ~z$r_buff1_thd0~0_In-319805130 |ULTIMATE.start_main_#t~ite52_Out-319805130|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-319805130|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-319805130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-319805130, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-319805130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-319805130} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-319805130|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-319805130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-319805130, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-319805130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-319805130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 03:56:22,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_~x~0_49 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 03:56:22,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:56:22 BasicIcfg [2019-12-27 03:56:22,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:56:22,680 INFO L168 Benchmark]: Toolchain (without parser) took 155703.80 ms. Allocated memory was 143.1 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.1 MB in the beginning and 1.1 GB in the end (delta: -982.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 03:56:22,680 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 03:56:22,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.98 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 97.9 MB in the beginning and 154.1 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:22,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.60 ms. Allocated memory is still 200.8 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:22,681 INFO L168 Benchmark]: Boogie Preprocessor took 44.52 ms. Allocated memory is still 200.8 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:22,682 INFO L168 Benchmark]: RCFGBuilder took 851.35 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 99.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:22,682 INFO L168 Benchmark]: TraceAbstraction took 154011.78 ms. Allocated memory was 200.8 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.7 MB in the beginning and 1.1 GB in the end (delta: -981.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 03:56:22,684 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 143.1 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.98 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 97.9 MB in the beginning and 154.1 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.60 ms. Allocated memory is still 200.8 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.52 ms. Allocated memory is still 200.8 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 851.35 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 99.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 154011.78 ms. Allocated memory was 200.8 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.7 MB in the beginning and 1.1 GB in the end (delta: -981.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.5s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=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] [L744] 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_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] [L822] FCALL, FORK 0 pthread_create(&t2288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L824] FCALL, FORK 0 pthread_create(&t2289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=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=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] [L764] 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_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=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] [L764] 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) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=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] [L785] 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_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_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] 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_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] [L766] 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 [L786] 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)) [L787] 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)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 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)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __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] [L791] 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)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __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] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L797] 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) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 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 [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_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] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 153.6s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 67.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10891 SDtfs, 15926 SDslu, 45261 SDs, 0 SdLazy, 41343 SolverSat, 966 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 873 GetRequests, 62 SyntacticMatches, 54 SemanticMatches, 757 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7572 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 50.2s AutomataMinimizationTime, 42 MinimizatonAttempts, 430235 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2349 NumberOfCodeBlocks, 2349 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2240 ConstructedInterpolants, 0 QuantifiedInterpolants, 654870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...