/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:54:04,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:54:04,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:54:04,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:54:04,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:54:04,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:54:04,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:54:04,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:54:04,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:54:04,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:54:04,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:54:04,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:54:04,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:54:04,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:54:04,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:54:04,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:54:04,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:54:04,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:54:04,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:54:04,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:54:04,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:54:04,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:54:04,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:54:04,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:54:04,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:54:04,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:54:04,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:54:04,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:54:04,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:54:04,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:54:04,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:54:04,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:54:04,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:54:04,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:54:04,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:54:04,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:54:04,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:54:04,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:54:04,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:54:04,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:54:04,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:54:04,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:54:04,295 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:54:04,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:54:04,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:54:04,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:54:04,297 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:54:04,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:54:04,298 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:54:04,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:54:04,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:54:04,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:54:04,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:54:04,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:54:04,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:54:04,300 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:54:04,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:54:04,301 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:54:04,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:54:04,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:54:04,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:54:04,302 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:54:04,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:54:04,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:54:04,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:54:04,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:54:04,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:54:04,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:54:04,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:54:04,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:54:04,303 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:54:04,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:54:04,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:54:04,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:54:04,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:54:04,639 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:54:04,641 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:54:04,642 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-15 18:54:04,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee7e9004/6eddc0eb06fd4f21a88eb5df4768da30/FLAG679f6e76d [2020-10-15 18:54:05,298 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:54:05,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-15 18:54:05,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee7e9004/6eddc0eb06fd4f21a88eb5df4768da30/FLAG679f6e76d [2020-10-15 18:54:05,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee7e9004/6eddc0eb06fd4f21a88eb5df4768da30 [2020-10-15 18:54:05,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:54:05,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:54:05,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:54:05,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:54:05,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:54:05,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:54:05" (1/1) ... [2020-10-15 18:54:05,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669a5c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:05, skipping insertion in model container [2020-10-15 18:54:05,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:54:05" (1/1) ... [2020-10-15 18:54:05,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:54:05,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:54:06,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:54:06,368 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:54:06,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:54:06,951 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:54:06,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06 WrapperNode [2020-10-15 18:54:06,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:54:06,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:54:06,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:54:06,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:54:06,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... [2020-10-15 18:54:06,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... [2020-10-15 18:54:07,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:54:07,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:54:07,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:54:07,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:54:07,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... [2020-10-15 18:54:07,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... [2020-10-15 18:54:07,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... [2020-10-15 18:54:07,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... [2020-10-15 18:54:07,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... [2020-10-15 18:54:07,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... [2020-10-15 18:54:07,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... [2020-10-15 18:54:07,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:54:07,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:54:07,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:54:07,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:54:07,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:54:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:54:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 18:54:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-15 18:54:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-15 18:54:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:54:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:54:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-15 18:54:07,202 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-15 18:54:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:54:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:54:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-15 18:54:07,204 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:54:07,794 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:54:07,795 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-15 18:54:07,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:54:07 BoogieIcfgContainer [2020-10-15 18:54:07,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:54:07,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:54:07,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:54:07,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:54:07,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:54:05" (1/3) ... [2020-10-15 18:54:07,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c938469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:54:07, skipping insertion in model container [2020-10-15 18:54:07,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:54:06" (2/3) ... [2020-10-15 18:54:07,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c938469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:54:07, skipping insertion in model container [2020-10-15 18:54:07,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:54:07" (3/3) ... [2020-10-15 18:54:07,805 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2020-10-15 18:54:07,816 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:54:07,816 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:54:07,824 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-15 18:54:07,825 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:54:07,857 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,857 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,857 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,861 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,861 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,861 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,861 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,861 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,862 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,862 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,862 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,862 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,863 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,863 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,863 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,863 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,864 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,864 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,864 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,864 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,865 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,865 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,865 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,865 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,869 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,869 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,869 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,869 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,870 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,870 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,870 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,870 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,870 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,870 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,871 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,871 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,871 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,872 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,872 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,875 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,876 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,876 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,876 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,876 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,877 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,878 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,887 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,888 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,888 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,888 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,888 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,888 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,889 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:54:07,916 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-15 18:54:07,936 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:54:07,936 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:54:07,936 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:54:07,936 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:54:07,936 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:54:07,936 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:54:07,936 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:54:07,937 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:54:07,952 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:54:07,955 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 155 transitions, 332 flow [2020-10-15 18:54:07,957 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 155 transitions, 332 flow [2020-10-15 18:54:07,959 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions, 332 flow [2020-10-15 18:54:08,030 INFO L129 PetriNetUnfolder]: 11/193 cut-off events. [2020-10-15 18:54:08,030 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-15 18:54:08,036 INFO L80 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-15 18:54:08,041 INFO L117 LiptonReduction]: Number of co-enabled transitions 2884 [2020-10-15 18:54:08,183 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:08,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:08,214 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:08,234 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:08,236 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:08,236 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:54:08,252 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:08,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:08,281 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:08,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:08,302 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:08,302 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:54:10,400 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:10,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:10,436 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:10,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:10,461 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:10,461 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:54:10,477 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:10,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:10,511 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:10,536 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:10,538 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:10,538 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:12,842 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:12,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:12,876 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:12,899 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:12,900 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:12,901 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:54:12,946 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:12,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:12,984 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:13,006 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:13,008 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:13,008 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:15,087 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:15,110 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:15,117 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:15,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:15,137 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:15,138 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:54:15,160 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:15,184 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:15,192 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:15,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:15,211 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:15,211 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:54:17,237 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,262 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:17,265 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,286 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:17,287 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,288 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 18:54:17,302 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:17,338 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:17,361 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,362 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:54:17,506 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,526 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:17,534 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,555 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:17,557 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,557 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:17,576 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,599 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:17,602 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:17,623 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:17,624 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:54:20,056 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:20,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:20,087 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:20,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:20,110 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:20,110 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:54:20,126 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:20,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:20,153 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:20,174 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:20,175 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:20,176 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 18:54:22,199 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:22,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:22,227 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:22,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:22,247 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:22,248 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:22,260 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:22,282 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:22,287 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:22,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:22,305 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:22,306 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:54:24,326 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:24,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:24,356 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:24,376 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:24,377 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:24,378 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:54:24,387 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:24,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:24,413 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:24,435 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:24,436 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:24,436 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:26,674 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:26,699 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:26,702 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:26,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:26,725 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:26,725 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:54:26,743 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:26,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:26,789 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:26,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:26,820 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:26,820 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 18:54:29,013 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:29,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:29,052 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:29,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:29,081 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:29,081 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 18:54:29,093 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:29,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:29,129 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:29,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:29,154 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:29,155 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:54:31,322 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:31,347 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:31,352 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:31,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:31,374 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:31,374 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:31,389 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:31,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:31,420 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:31,442 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:31,443 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:31,443 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:33,709 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:33,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:33,735 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:33,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:33,755 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:33,756 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:54:33,766 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:33,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:33,794 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:33,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:33,816 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:33,816 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-15 18:54:35,888 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:35,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:35,921 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:35,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:35,945 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:35,945 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:35,954 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:35,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:35,982 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:36,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:36,003 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:36,003 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:38,014 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:38,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:38,040 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:38,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:38,074 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:38,074 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:38,091 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:38,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:38,121 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:38,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:38,145 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:38,145 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:40,271 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:40,308 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:40,312 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:40,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:40,343 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:40,343 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:40,360 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:40,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:40,408 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:40,443 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:40,445 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:40,445 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:42,775 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:42,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:42,801 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:42,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:42,823 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:42,824 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:54:42,836 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:42,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:42,864 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:42,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:42,882 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:42,882 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:44,963 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:44,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:44,992 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:45,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:45,010 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:45,010 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:45,026 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:45,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:45,053 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:45,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:45,072 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:45,072 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:54:47,114 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:47,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:47,144 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:47,167 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:47,168 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:47,169 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-15 18:54:47,230 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:47,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:47,253 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:47,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:47,270 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:47,271 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:54:47,286 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:47,311 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:47,315 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:47,335 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:47,336 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:47,336 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:54:49,555 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:49,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:49,579 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:49,596 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:49,597 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:49,598 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:54:49,610 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:49,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:49,638 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:49,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:49,658 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:49,658 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:54:51,691 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:51,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:51,716 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:51,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:51,737 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:51,738 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:54:51,747 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:51,768 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:51,772 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:51,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:51,789 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:51,789 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 18:54:53,940 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:53,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:53,969 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:53,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:53,990 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:53,990 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-15 18:54:54,006 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:54,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:54,048 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:54,069 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:54,070 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:54,071 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:54:56,838 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:56,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:56,868 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:56,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:56,893 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:56,893 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:54:56,913 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:56,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:56,944 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:56,967 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:54:56,968 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:54:56,968 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:54:59,905 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2020-10-15 18:55:00,094 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-15 18:55:00,788 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2020-10-15 18:55:00,807 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:01,179 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-10-15 18:55:01,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:01,190 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:01,475 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-15 18:55:01,475 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:01,476 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:01,476 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:250, output treesize:222 [2020-10-15 18:55:01,702 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-15 18:55:02,603 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2020-10-15 18:55:02,624 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:03,328 WARN L193 SmtUtils]: Spent 703.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-15 18:55:03,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:03,337 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:03,912 WARN L193 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 18:55:03,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:03,914 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:03,915 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-15 18:55:04,395 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 18:55:04,647 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-15 18:55:04,860 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-15 18:55:04,873 INFO L132 LiptonReduction]: Checked pairs total: 6656 [2020-10-15 18:55:04,874 INFO L134 LiptonReduction]: Total number of compositions: 167 [2020-10-15 18:55:04,880 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-10-15 18:55:04,911 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-10-15 18:55:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-10-15 18:55:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-15 18:55:04,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:04,920 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-15 18:55:04,920 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:04,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash 557, now seen corresponding path program 1 times [2020-10-15 18:55:04,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:04,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216993610] [2020-10-15 18:55:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:05,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216993610] [2020-10-15 18:55:05,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:05,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-15 18:55:05,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36881622] [2020-10-15 18:55:05,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-15 18:55:05,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:05,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-15 18:55:05,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-15 18:55:05,185 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-10-15 18:55:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:05,235 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-10-15 18:55:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-15 18:55:05,237 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-15 18:55:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:05,255 INFO L225 Difference]: With dead ends: 423 [2020-10-15 18:55:05,255 INFO L226 Difference]: Without dead ends: 385 [2020-10-15 18:55:05,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-15 18:55:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-15 18:55:05,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-10-15 18:55:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-15 18:55:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-10-15 18:55:05,338 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-10-15 18:55:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:05,338 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-10-15 18:55:05,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-15 18:55:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-10-15 18:55:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-15 18:55:05,339 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:05,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-15 18:55:05,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:55:05,340 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash 17154767, now seen corresponding path program 1 times [2020-10-15 18:55:05,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:05,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587528828] [2020-10-15 18:55:05,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:05,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587528828] [2020-10-15 18:55:05,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:05,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:55:05,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763108618] [2020-10-15 18:55:05,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:55:05,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:55:05,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:55:05,599 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-10-15 18:55:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:05,735 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-10-15 18:55:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:55:05,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-15 18:55:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:05,745 INFO L225 Difference]: With dead ends: 540 [2020-10-15 18:55:05,745 INFO L226 Difference]: Without dead ends: 540 [2020-10-15 18:55:05,746 INFO L677 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 [2020-10-15 18:55:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-10-15 18:55:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-10-15 18:55:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-15 18:55:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-10-15 18:55:05,814 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-10-15 18:55:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:05,815 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-10-15 18:55:05,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:55:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-10-15 18:55:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-15 18:55:05,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:05,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-15 18:55:05,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:55:05,818 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:05,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:05,819 INFO L82 PathProgramCache]: Analyzing trace with hash -694138238, now seen corresponding path program 1 times [2020-10-15 18:55:05,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:05,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247746159] [2020-10-15 18:55:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:05,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247746159] [2020-10-15 18:55:05,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:05,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:55:05,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217771531] [2020-10-15 18:55:05,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:55:05,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:55:05,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:55:05,909 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2020-10-15 18:55:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:06,054 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2020-10-15 18:55:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:55:06,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-10-15 18:55:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:06,060 INFO L225 Difference]: With dead ends: 599 [2020-10-15 18:55:06,060 INFO L226 Difference]: Without dead ends: 514 [2020-10-15 18:55:06,061 INFO L677 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 [2020-10-15 18:55:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-15 18:55:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-10-15 18:55:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-15 18:55:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-10-15 18:55:06,083 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-10-15 18:55:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:06,084 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-10-15 18:55:06,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:55:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-10-15 18:55:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 18:55:06,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:06,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:06,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:55:06,087 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1786983460, now seen corresponding path program 1 times [2020-10-15 18:55:06,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:06,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070422014] [2020-10-15 18:55:06,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:06,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070422014] [2020-10-15 18:55:06,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:06,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:55:06,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958335429] [2020-10-15 18:55:06,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:55:06,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:06,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:55:06,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:55:06,158 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-10-15 18:55:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:06,181 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-15 18:55:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:55:06,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-15 18:55:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:06,183 INFO L225 Difference]: With dead ends: 162 [2020-10-15 18:55:06,183 INFO L226 Difference]: Without dead ends: 162 [2020-10-15 18:55:06,184 INFO L677 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 [2020-10-15 18:55:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-15 18:55:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-15 18:55:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-15 18:55:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-15 18:55:06,189 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-15 18:55:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:06,189 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-15 18:55:06,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:55:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-15 18:55:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:06,191 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:06,191 INFO L422 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] [2020-10-15 18:55:06,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:55:06,192 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:06,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1425167552, now seen corresponding path program 1 times [2020-10-15 18:55:06,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:06,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163341201] [2020-10-15 18:55:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:06,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163341201] [2020-10-15 18:55:06,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:06,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:55:06,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079777480] [2020-10-15 18:55:06,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:55:06,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:06,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:55:06,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:55:06,604 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 12 states. [2020-10-15 18:55:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:07,689 INFO L93 Difference]: Finished difference Result 424 states and 841 transitions. [2020-10-15 18:55:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 18:55:07,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:55:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:07,694 INFO L225 Difference]: With dead ends: 424 [2020-10-15 18:55:07,694 INFO L226 Difference]: Without dead ends: 424 [2020-10-15 18:55:07,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-10-15 18:55:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-15 18:55:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 264. [2020-10-15 18:55:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-10-15 18:55:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 563 transitions. [2020-10-15 18:55:07,709 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 563 transitions. Word has length 22 [2020-10-15 18:55:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:07,709 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 563 transitions. [2020-10-15 18:55:07,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:55:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 563 transitions. [2020-10-15 18:55:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:07,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:07,716 INFO L422 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] [2020-10-15 18:55:07,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:55:07,716 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:07,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:07,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1425167535, now seen corresponding path program 1 times [2020-10-15 18:55:07,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:07,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073222867] [2020-10-15 18:55:07,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:07,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073222867] [2020-10-15 18:55:07,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:07,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:55:07,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707779081] [2020-10-15 18:55:07,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:55:07,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:07,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:55:07,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:55:07,909 INFO L87 Difference]: Start difference. First operand 264 states and 563 transitions. Second operand 6 states. [2020-10-15 18:55:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:08,023 INFO L93 Difference]: Finished difference Result 158 states and 264 transitions. [2020-10-15 18:55:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:55:08,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-15 18:55:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:08,025 INFO L225 Difference]: With dead ends: 158 [2020-10-15 18:55:08,025 INFO L226 Difference]: Without dead ends: 158 [2020-10-15 18:55:08,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:55:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-15 18:55:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-10-15 18:55:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-15 18:55:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 264 transitions. [2020-10-15 18:55:08,031 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 264 transitions. Word has length 22 [2020-10-15 18:55:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:08,031 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 264 transitions. [2020-10-15 18:55:08,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:55:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 264 transitions. [2020-10-15 18:55:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:08,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:08,033 INFO L422 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] [2020-10-15 18:55:08,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:55:08,033 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash 864306409, now seen corresponding path program 1 times [2020-10-15 18:55:08,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:08,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232812370] [2020-10-15 18:55:08,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:08,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232812370] [2020-10-15 18:55:08,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:08,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:55:08,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151772821] [2020-10-15 18:55:08,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:55:08,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:08,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:55:08,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:55:08,199 INFO L87 Difference]: Start difference. First operand 158 states and 264 transitions. Second operand 8 states. [2020-10-15 18:55:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:08,486 INFO L93 Difference]: Finished difference Result 164 states and 264 transitions. [2020-10-15 18:55:08,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:55:08,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 18:55:08,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:08,488 INFO L225 Difference]: With dead ends: 164 [2020-10-15 18:55:08,488 INFO L226 Difference]: Without dead ends: 164 [2020-10-15 18:55:08,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:55:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-10-15 18:55:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2020-10-15 18:55:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-15 18:55:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 240 transitions. [2020-10-15 18:55:08,493 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 240 transitions. Word has length 22 [2020-10-15 18:55:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:08,493 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 240 transitions. [2020-10-15 18:55:08,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:55:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 240 transitions. [2020-10-15 18:55:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:08,494 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:08,494 INFO L422 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] [2020-10-15 18:55:08,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:55:08,495 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash -412491025, now seen corresponding path program 2 times [2020-10-15 18:55:08,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:08,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896697152] [2020-10-15 18:55:08,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:09,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896697152] [2020-10-15 18:55:09,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:09,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:09,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989155712] [2020-10-15 18:55:09,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:09,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:09,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:09,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:09,224 INFO L87 Difference]: Start difference. First operand 150 states and 240 transitions. Second operand 14 states. [2020-10-15 18:55:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:10,179 INFO L93 Difference]: Finished difference Result 179 states and 267 transitions. [2020-10-15 18:55:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 18:55:10,180 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:10,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:10,182 INFO L225 Difference]: With dead ends: 179 [2020-10-15 18:55:10,182 INFO L226 Difference]: Without dead ends: 165 [2020-10-15 18:55:10,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-15 18:55:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2020-10-15 18:55:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-15 18:55:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2020-10-15 18:55:10,188 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 22 [2020-10-15 18:55:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:10,188 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2020-10-15 18:55:10,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2020-10-15 18:55:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:10,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:10,189 INFO L422 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] [2020-10-15 18:55:10,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:55:10,190 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash -524474255, now seen corresponding path program 3 times [2020-10-15 18:55:10,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:10,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16971767] [2020-10-15 18:55:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:10,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16971767] [2020-10-15 18:55:10,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:10,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:10,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431124228] [2020-10-15 18:55:10,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:10,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:10,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:10,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:10,830 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 14 states. [2020-10-15 18:55:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:11,743 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2020-10-15 18:55:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-15 18:55:11,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:11,744 INFO L225 Difference]: With dead ends: 176 [2020-10-15 18:55:11,744 INFO L226 Difference]: Without dead ends: 163 [2020-10-15 18:55:11,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-10-15 18:55:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-15 18:55:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-10-15 18:55:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-15 18:55:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 251 transitions. [2020-10-15 18:55:11,750 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 251 transitions. Word has length 22 [2020-10-15 18:55:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:11,751 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 251 transitions. [2020-10-15 18:55:11,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 251 transitions. [2020-10-15 18:55:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:11,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:11,752 INFO L422 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] [2020-10-15 18:55:11,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:55:11,752 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1681973083, now seen corresponding path program 2 times [2020-10-15 18:55:11,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:11,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678618865] [2020-10-15 18:55:11,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:11,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678618865] [2020-10-15 18:55:11,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:11,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:55:11,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185046206] [2020-10-15 18:55:11,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 18:55:11,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 18:55:11,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:55:11,929 INFO L87 Difference]: Start difference. First operand 163 states and 251 transitions. Second operand 11 states. [2020-10-15 18:55:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:12,475 INFO L93 Difference]: Finished difference Result 223 states and 354 transitions. [2020-10-15 18:55:12,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:12,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-15 18:55:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:12,477 INFO L225 Difference]: With dead ends: 223 [2020-10-15 18:55:12,478 INFO L226 Difference]: Without dead ends: 223 [2020-10-15 18:55:12,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2020-10-15 18:55:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-10-15 18:55:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 174. [2020-10-15 18:55:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-15 18:55:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 274 transitions. [2020-10-15 18:55:12,484 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 274 transitions. Word has length 22 [2020-10-15 18:55:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:12,484 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 274 transitions. [2020-10-15 18:55:12,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 18:55:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 274 transitions. [2020-10-15 18:55:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:12,485 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:12,486 INFO L422 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] [2020-10-15 18:55:12,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:55:12,486 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:12,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash 671772819, now seen corresponding path program 4 times [2020-10-15 18:55:12,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:12,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828442375] [2020-10-15 18:55:12,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:13,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828442375] [2020-10-15 18:55:13,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:13,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:13,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558722456] [2020-10-15 18:55:13,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:13,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:13,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:13,218 INFO L87 Difference]: Start difference. First operand 174 states and 274 transitions. Second operand 14 states. [2020-10-15 18:55:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:14,150 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2020-10-15 18:55:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 18:55:14,150 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:14,152 INFO L225 Difference]: With dead ends: 188 [2020-10-15 18:55:14,152 INFO L226 Difference]: Without dead ends: 180 [2020-10-15 18:55:14,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-15 18:55:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2020-10-15 18:55:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-15 18:55:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 273 transitions. [2020-10-15 18:55:14,161 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 273 transitions. Word has length 22 [2020-10-15 18:55:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:14,161 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 273 transitions. [2020-10-15 18:55:14,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 273 transitions. [2020-10-15 18:55:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:14,163 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:14,164 INFO L422 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] [2020-10-15 18:55:14,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:55:14,164 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:14,164 INFO L82 PathProgramCache]: Analyzing trace with hash -481747075, now seen corresponding path program 5 times [2020-10-15 18:55:14,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:14,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832130093] [2020-10-15 18:55:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:14,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832130093] [2020-10-15 18:55:14,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:14,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:14,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019591969] [2020-10-15 18:55:14,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:14,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:14,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:14,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:14,743 INFO L87 Difference]: Start difference. First operand 174 states and 273 transitions. Second operand 14 states. [2020-10-15 18:55:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:15,575 INFO L93 Difference]: Finished difference Result 187 states and 285 transitions. [2020-10-15 18:55:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:15,576 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:15,577 INFO L225 Difference]: With dead ends: 187 [2020-10-15 18:55:15,577 INFO L226 Difference]: Without dead ends: 174 [2020-10-15 18:55:15,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-15 18:55:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2020-10-15 18:55:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-15 18:55:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 264 transitions. [2020-10-15 18:55:15,584 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 264 transitions. Word has length 22 [2020-10-15 18:55:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:15,584 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 264 transitions. [2020-10-15 18:55:15,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 264 transitions. [2020-10-15 18:55:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:15,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:15,585 INFO L422 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] [2020-10-15 18:55:15,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:55:15,586 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:15,586 INFO L82 PathProgramCache]: Analyzing trace with hash 186432761, now seen corresponding path program 6 times [2020-10-15 18:55:15,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:15,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354973153] [2020-10-15 18:55:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:16,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354973153] [2020-10-15 18:55:16,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:16,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:16,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877856898] [2020-10-15 18:55:16,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:16,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:16,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:16,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:16,179 INFO L87 Difference]: Start difference. First operand 170 states and 264 transitions. Second operand 14 states. [2020-10-15 18:55:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:17,116 INFO L93 Difference]: Finished difference Result 180 states and 273 transitions. [2020-10-15 18:55:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:17,117 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:17,118 INFO L225 Difference]: With dead ends: 180 [2020-10-15 18:55:17,118 INFO L226 Difference]: Without dead ends: 166 [2020-10-15 18:55:17,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-10-15 18:55:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2020-10-15 18:55:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-10-15 18:55:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 256 transitions. [2020-10-15 18:55:17,124 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 256 transitions. Word has length 22 [2020-10-15 18:55:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:17,124 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 256 transitions. [2020-10-15 18:55:17,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 256 transitions. [2020-10-15 18:55:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:17,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:17,125 INFO L422 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] [2020-10-15 18:55:17,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:55:17,126 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1728779239, now seen corresponding path program 7 times [2020-10-15 18:55:17,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:17,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503862408] [2020-10-15 18:55:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:17,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503862408] [2020-10-15 18:55:17,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:17,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:17,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421772936] [2020-10-15 18:55:17,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:17,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:17,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:17,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:17,695 INFO L87 Difference]: Start difference. First operand 166 states and 256 transitions. Second operand 14 states. [2020-10-15 18:55:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:18,562 INFO L93 Difference]: Finished difference Result 172 states and 261 transitions. [2020-10-15 18:55:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 18:55:18,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:18,564 INFO L225 Difference]: With dead ends: 172 [2020-10-15 18:55:18,565 INFO L226 Difference]: Without dead ends: 152 [2020-10-15 18:55:18,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-15 18:55:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-15 18:55:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-15 18:55:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-15 18:55:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2020-10-15 18:55:18,570 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 22 [2020-10-15 18:55:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:18,571 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2020-10-15 18:55:18,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2020-10-15 18:55:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:18,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:18,572 INFO L422 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] [2020-10-15 18:55:18,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:55:18,572 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:18,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1510347584, now seen corresponding path program 2 times [2020-10-15 18:55:18,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:18,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311736974] [2020-10-15 18:55:18,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:18,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311736974] [2020-10-15 18:55:18,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:18,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:55:18,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514316354] [2020-10-15 18:55:18,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:55:18,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:18,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:55:18,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:55:18,808 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand 9 states. [2020-10-15 18:55:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:19,171 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2020-10-15 18:55:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:55:19,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 18:55:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:19,177 INFO L225 Difference]: With dead ends: 188 [2020-10-15 18:55:19,178 INFO L226 Difference]: Without dead ends: 171 [2020-10-15 18:55:19,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-15 18:55:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2020-10-15 18:55:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-15 18:55:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 217 transitions. [2020-10-15 18:55:19,185 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 217 transitions. Word has length 22 [2020-10-15 18:55:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:19,185 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 217 transitions. [2020-10-15 18:55:19,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:55:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 217 transitions. [2020-10-15 18:55:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:19,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:19,186 INFO L422 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] [2020-10-15 18:55:19,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:55:19,187 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1730688272, now seen corresponding path program 3 times [2020-10-15 18:55:19,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:19,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304355641] [2020-10-15 18:55:19,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:19,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304355641] [2020-10-15 18:55:19,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:19,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:55:19,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951411720] [2020-10-15 18:55:19,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:55:19,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:19,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:55:19,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:55:19,423 INFO L87 Difference]: Start difference. First operand 135 states and 217 transitions. Second operand 9 states. [2020-10-15 18:55:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:19,791 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2020-10-15 18:55:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:55:19,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 18:55:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:19,794 INFO L225 Difference]: With dead ends: 171 [2020-10-15 18:55:19,794 INFO L226 Difference]: Without dead ends: 171 [2020-10-15 18:55:19,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-15 18:55:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2020-10-15 18:55:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-15 18:55:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 226 transitions. [2020-10-15 18:55:19,799 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 226 transitions. Word has length 22 [2020-10-15 18:55:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:19,800 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 226 transitions. [2020-10-15 18:55:19,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:55:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 226 transitions. [2020-10-15 18:55:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:19,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:19,801 INFO L422 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] [2020-10-15 18:55:19,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:55:19,801 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:19,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:19,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1730688289, now seen corresponding path program 8 times [2020-10-15 18:55:19,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:19,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782391707] [2020-10-15 18:55:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:20,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782391707] [2020-10-15 18:55:20,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:20,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:20,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827882647] [2020-10-15 18:55:20,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:20,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:20,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:20,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:20,487 INFO L87 Difference]: Start difference. First operand 140 states and 226 transitions. Second operand 14 states. [2020-10-15 18:55:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:21,533 INFO L93 Difference]: Finished difference Result 171 states and 271 transitions. [2020-10-15 18:55:21,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:21,534 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:21,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:21,535 INFO L225 Difference]: With dead ends: 171 [2020-10-15 18:55:21,535 INFO L226 Difference]: Without dead ends: 143 [2020-10-15 18:55:21,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-15 18:55:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2020-10-15 18:55:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-15 18:55:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 225 transitions. [2020-10-15 18:55:21,539 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 225 transitions. Word has length 22 [2020-10-15 18:55:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:21,540 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 225 transitions. [2020-10-15 18:55:21,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 225 transitions. [2020-10-15 18:55:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:21,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:21,541 INFO L422 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] [2020-10-15 18:55:21,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:55:21,541 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1523655162, now seen corresponding path program 4 times [2020-10-15 18:55:21,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:21,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136304507] [2020-10-15 18:55:21,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:21,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136304507] [2020-10-15 18:55:21,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:21,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:55:21,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517052440] [2020-10-15 18:55:21,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:55:21,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:21,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:55:21,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:55:21,738 INFO L87 Difference]: Start difference. First operand 140 states and 225 transitions. Second operand 9 states. [2020-10-15 18:55:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:22,090 INFO L93 Difference]: Finished difference Result 176 states and 276 transitions. [2020-10-15 18:55:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:55:22,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 18:55:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:22,093 INFO L225 Difference]: With dead ends: 176 [2020-10-15 18:55:22,093 INFO L226 Difference]: Without dead ends: 176 [2020-10-15 18:55:22,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-15 18:55:22,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2020-10-15 18:55:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-15 18:55:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2020-10-15 18:55:22,099 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 22 [2020-10-15 18:55:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:22,100 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2020-10-15 18:55:22,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:55:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2020-10-15 18:55:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:22,101 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:22,101 INFO L422 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] [2020-10-15 18:55:22,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:55:22,102 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:22,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:22,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1523655179, now seen corresponding path program 9 times [2020-10-15 18:55:22,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:22,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183854983] [2020-10-15 18:55:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:22,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183854983] [2020-10-15 18:55:22,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:22,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:22,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193025927] [2020-10-15 18:55:22,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:22,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:22,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:22,996 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand 14 states. [2020-10-15 18:55:23,618 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-10-15 18:55:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:24,202 INFO L93 Difference]: Finished difference Result 147 states and 237 transitions. [2020-10-15 18:55:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:24,203 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:24,204 INFO L225 Difference]: With dead ends: 147 [2020-10-15 18:55:24,204 INFO L226 Difference]: Without dead ends: 125 [2020-10-15 18:55:24,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-15 18:55:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2020-10-15 18:55:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-15 18:55:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 175 transitions. [2020-10-15 18:55:24,207 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 175 transitions. Word has length 22 [2020-10-15 18:55:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:24,208 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 175 transitions. [2020-10-15 18:55:24,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 175 transitions. [2020-10-15 18:55:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:24,208 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:24,208 INFO L422 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] [2020-10-15 18:55:24,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 18:55:24,209 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:24,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1986983371, now seen corresponding path program 10 times [2020-10-15 18:55:24,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:24,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475098770] [2020-10-15 18:55:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:24,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475098770] [2020-10-15 18:55:24,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:24,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:24,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537847606] [2020-10-15 18:55:24,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:24,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:24,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:24,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:24,773 INFO L87 Difference]: Start difference. First operand 109 states and 175 transitions. Second operand 14 states. [2020-10-15 18:55:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:25,806 INFO L93 Difference]: Finished difference Result 148 states and 232 transitions. [2020-10-15 18:55:25,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-15 18:55:25,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:25,808 INFO L225 Difference]: With dead ends: 148 [2020-10-15 18:55:25,808 INFO L226 Difference]: Without dead ends: 134 [2020-10-15 18:55:25,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-15 18:55:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-15 18:55:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2020-10-15 18:55:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-15 18:55:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 173 transitions. [2020-10-15 18:55:25,812 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 173 transitions. Word has length 22 [2020-10-15 18:55:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:25,812 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 173 transitions. [2020-10-15 18:55:25,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 173 transitions. [2020-10-15 18:55:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:25,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:25,813 INFO L422 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] [2020-10-15 18:55:25,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 18:55:25,814 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1039623051, now seen corresponding path program 11 times [2020-10-15 18:55:25,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:25,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628409120] [2020-10-15 18:55:25,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:26,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628409120] [2020-10-15 18:55:26,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:26,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:26,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855186149] [2020-10-15 18:55:26,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:26,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:26,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:26,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:26,396 INFO L87 Difference]: Start difference. First operand 109 states and 173 transitions. Second operand 14 states. [2020-10-15 18:55:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:27,279 INFO L93 Difference]: Finished difference Result 140 states and 216 transitions. [2020-10-15 18:55:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 18:55:27,280 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:27,281 INFO L225 Difference]: With dead ends: 140 [2020-10-15 18:55:27,281 INFO L226 Difference]: Without dead ends: 124 [2020-10-15 18:55:27,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-15 18:55:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2020-10-15 18:55:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-15 18:55:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 157 transitions. [2020-10-15 18:55:27,284 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 157 transitions. Word has length 22 [2020-10-15 18:55:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:27,284 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 157 transitions. [2020-10-15 18:55:27,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 157 transitions. [2020-10-15 18:55:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:27,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:27,285 INFO L422 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] [2020-10-15 18:55:27,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 18:55:27,286 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:27,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:27,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2100578423, now seen corresponding path program 12 times [2020-10-15 18:55:27,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:27,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185108370] [2020-10-15 18:55:27,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:27,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185108370] [2020-10-15 18:55:27,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:27,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:27,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601326268] [2020-10-15 18:55:27,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:27,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:27,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:27,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:27,873 INFO L87 Difference]: Start difference. First operand 99 states and 157 transitions. Second operand 14 states. [2020-10-15 18:55:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:28,827 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2020-10-15 18:55:28,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:28,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:28,829 INFO L225 Difference]: With dead ends: 138 [2020-10-15 18:55:28,829 INFO L226 Difference]: Without dead ends: 105 [2020-10-15 18:55:28,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-15 18:55:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2020-10-15 18:55:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-15 18:55:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2020-10-15 18:55:28,832 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 22 [2020-10-15 18:55:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:28,832 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2020-10-15 18:55:28,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2020-10-15 18:55:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:28,834 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:28,834 INFO L422 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] [2020-10-15 18:55:28,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 18:55:28,835 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:28,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1068559361, now seen corresponding path program 13 times [2020-10-15 18:55:28,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:28,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439594937] [2020-10-15 18:55:28,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:29,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439594937] [2020-10-15 18:55:29,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:29,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:29,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452185093] [2020-10-15 18:55:29,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:29,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:29,558 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand 14 states. [2020-10-15 18:55:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:30,545 INFO L93 Difference]: Finished difference Result 126 states and 193 transitions. [2020-10-15 18:55:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:30,546 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:30,547 INFO L225 Difference]: With dead ends: 126 [2020-10-15 18:55:30,547 INFO L226 Difference]: Without dead ends: 92 [2020-10-15 18:55:30,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-15 18:55:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2020-10-15 18:55:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-15 18:55:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2020-10-15 18:55:30,551 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 22 [2020-10-15 18:55:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:30,552 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2020-10-15 18:55:30,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2020-10-15 18:55:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:30,552 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:30,552 INFO L422 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] [2020-10-15 18:55:30,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 18:55:30,553 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:30,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1273870831, now seen corresponding path program 14 times [2020-10-15 18:55:30,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:30,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185451147] [2020-10-15 18:55:30,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:31,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185451147] [2020-10-15 18:55:31,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:31,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:31,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376064245] [2020-10-15 18:55:31,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:31,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:31,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:31,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:31,155 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand 14 states. [2020-10-15 18:55:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:31,988 INFO L93 Difference]: Finished difference Result 95 states and 143 transitions. [2020-10-15 18:55:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:31,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:31,990 INFO L225 Difference]: With dead ends: 95 [2020-10-15 18:55:31,990 INFO L226 Difference]: Without dead ends: 80 [2020-10-15 18:55:31,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-15 18:55:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-15 18:55:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-15 18:55:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2020-10-15 18:55:31,994 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 22 [2020-10-15 18:55:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:31,994 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2020-10-15 18:55:31,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2020-10-15 18:55:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:31,995 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:31,995 INFO L422 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] [2020-10-15 18:55:31,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-15 18:55:31,995 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:31,996 INFO L82 PathProgramCache]: Analyzing trace with hash 341292095, now seen corresponding path program 15 times [2020-10-15 18:55:31,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:31,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652983813] [2020-10-15 18:55:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:32,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652983813] [2020-10-15 18:55:32,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:32,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:32,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429212166] [2020-10-15 18:55:32,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:32,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:32,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:32,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:32,614 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand 14 states. [2020-10-15 18:55:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:33,557 INFO L93 Difference]: Finished difference Result 110 states and 172 transitions. [2020-10-15 18:55:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:33,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:33,558 INFO L225 Difference]: With dead ends: 110 [2020-10-15 18:55:33,558 INFO L226 Difference]: Without dead ends: 77 [2020-10-15 18:55:33,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-15 18:55:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-15 18:55:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-15 18:55:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2020-10-15 18:55:33,562 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 124 transitions. Word has length 22 [2020-10-15 18:55:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:33,563 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 124 transitions. [2020-10-15 18:55:33,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 124 transitions. [2020-10-15 18:55:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:33,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:33,564 INFO L422 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] [2020-10-15 18:55:33,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-15 18:55:33,565 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2099874535, now seen corresponding path program 16 times [2020-10-15 18:55:33,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:33,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967397555] [2020-10-15 18:55:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:34,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967397555] [2020-10-15 18:55:34,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:34,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:34,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551198854] [2020-10-15 18:55:34,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:34,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:34,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:34,349 INFO L87 Difference]: Start difference. First operand 77 states and 124 transitions. Second operand 14 states. [2020-10-15 18:55:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:35,312 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2020-10-15 18:55:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:35,313 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:35,314 INFO L225 Difference]: With dead ends: 111 [2020-10-15 18:55:35,314 INFO L226 Difference]: Without dead ends: 80 [2020-10-15 18:55:35,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-15 18:55:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2020-10-15 18:55:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-15 18:55:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 127 transitions. [2020-10-15 18:55:35,318 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 127 transitions. Word has length 22 [2020-10-15 18:55:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:35,318 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 127 transitions. [2020-10-15 18:55:35,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 127 transitions. [2020-10-15 18:55:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:35,319 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:35,319 INFO L422 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] [2020-10-15 18:55:35,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-15 18:55:35,320 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:35,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1892841425, now seen corresponding path program 17 times [2020-10-15 18:55:35,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:35,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451223830] [2020-10-15 18:55:35,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:35,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451223830] [2020-10-15 18:55:35,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:35,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:35,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199481423] [2020-10-15 18:55:35,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:35,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:35,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:35,961 INFO L87 Difference]: Start difference. First operand 79 states and 127 transitions. Second operand 14 states. [2020-10-15 18:55:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:36,966 INFO L93 Difference]: Finished difference Result 128 states and 209 transitions. [2020-10-15 18:55:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:36,967 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:36,968 INFO L225 Difference]: With dead ends: 128 [2020-10-15 18:55:36,968 INFO L226 Difference]: Without dead ends: 103 [2020-10-15 18:55:36,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:36,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-15 18:55:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2020-10-15 18:55:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-15 18:55:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2020-10-15 18:55:36,971 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 22 [2020-10-15 18:55:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:36,971 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2020-10-15 18:55:36,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2020-10-15 18:55:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:36,972 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:36,972 INFO L422 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] [2020-10-15 18:55:36,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-15 18:55:36,972 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:36,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1938797679, now seen corresponding path program 18 times [2020-10-15 18:55:36,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:36,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488048750] [2020-10-15 18:55:36,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:37,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488048750] [2020-10-15 18:55:37,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:37,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:37,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111805643] [2020-10-15 18:55:37,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:37,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:37,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:37,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:37,547 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand 14 states. [2020-10-15 18:55:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:38,536 INFO L93 Difference]: Finished difference Result 134 states and 212 transitions. [2020-10-15 18:55:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-15 18:55:38,537 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:38,538 INFO L225 Difference]: With dead ends: 134 [2020-10-15 18:55:38,538 INFO L226 Difference]: Without dead ends: 117 [2020-10-15 18:55:38,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-15 18:55:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-15 18:55:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 91. [2020-10-15 18:55:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-15 18:55:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 147 transitions. [2020-10-15 18:55:38,542 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 147 transitions. Word has length 22 [2020-10-15 18:55:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:38,542 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 147 transitions. [2020-10-15 18:55:38,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 147 transitions. [2020-10-15 18:55:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:38,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:38,543 INFO L422 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] [2020-10-15 18:55:38,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-15 18:55:38,543 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1408809297, now seen corresponding path program 19 times [2020-10-15 18:55:38,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:38,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092770742] [2020-10-15 18:55:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:39,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092770742] [2020-10-15 18:55:39,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:39,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:39,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165064751] [2020-10-15 18:55:39,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:39,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:39,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:39,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:39,302 INFO L87 Difference]: Start difference. First operand 91 states and 147 transitions. Second operand 14 states. [2020-10-15 18:55:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:40,220 INFO L93 Difference]: Finished difference Result 126 states and 196 transitions. [2020-10-15 18:55:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 18:55:40,221 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:40,222 INFO L225 Difference]: With dead ends: 126 [2020-10-15 18:55:40,222 INFO L226 Difference]: Without dead ends: 107 [2020-10-15 18:55:40,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-15 18:55:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2020-10-15 18:55:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-15 18:55:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2020-10-15 18:55:40,227 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 22 [2020-10-15 18:55:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:40,227 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-10-15 18:55:40,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2020-10-15 18:55:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:40,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:40,228 INFO L422 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] [2020-10-15 18:55:40,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-15 18:55:40,228 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1825202627, now seen corresponding path program 20 times [2020-10-15 18:55:40,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:40,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766875969] [2020-10-15 18:55:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:40,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766875969] [2020-10-15 18:55:40,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:40,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:40,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863572717] [2020-10-15 18:55:40,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:40,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:40,861 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand 14 states. [2020-10-15 18:55:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:41,806 INFO L93 Difference]: Finished difference Result 123 states and 196 transitions. [2020-10-15 18:55:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:41,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:41,807 INFO L225 Difference]: With dead ends: 123 [2020-10-15 18:55:41,808 INFO L226 Difference]: Without dead ends: 87 [2020-10-15 18:55:41,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-15 18:55:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2020-10-15 18:55:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-15 18:55:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2020-10-15 18:55:41,811 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 22 [2020-10-15 18:55:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:41,811 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2020-10-15 18:55:41,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2020-10-15 18:55:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:41,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:41,812 INFO L422 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] [2020-10-15 18:55:41,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-15 18:55:41,813 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:41,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash -699373115, now seen corresponding path program 21 times [2020-10-15 18:55:41,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:41,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798226404] [2020-10-15 18:55:41,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:42,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798226404] [2020-10-15 18:55:42,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:42,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:42,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354687868] [2020-10-15 18:55:42,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:42,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:42,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:42,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:42,739 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand 14 states. [2020-10-15 18:55:43,209 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-10-15 18:55:43,406 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2020-10-15 18:55:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:44,049 INFO L93 Difference]: Finished difference Result 108 states and 168 transitions. [2020-10-15 18:55:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:44,050 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:44,051 INFO L225 Difference]: With dead ends: 108 [2020-10-15 18:55:44,051 INFO L226 Difference]: Without dead ends: 62 [2020-10-15 18:55:44,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-15 18:55:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-15 18:55:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-15 18:55:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2020-10-15 18:55:44,053 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 22 [2020-10-15 18:55:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:44,054 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2020-10-15 18:55:44,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2020-10-15 18:55:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:44,054 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:44,054 INFO L422 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] [2020-10-15 18:55:44,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-15 18:55:44,055 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash -675636301, now seen corresponding path program 22 times [2020-10-15 18:55:44,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:44,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888549948] [2020-10-15 18:55:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:44,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888549948] [2020-10-15 18:55:44,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:44,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:44,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859052949] [2020-10-15 18:55:44,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:44,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:44,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:44,810 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand 14 states. [2020-10-15 18:55:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:45,854 INFO L93 Difference]: Finished difference Result 92 states and 143 transitions. [2020-10-15 18:55:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:45,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:45,856 INFO L225 Difference]: With dead ends: 92 [2020-10-15 18:55:45,856 INFO L226 Difference]: Without dead ends: 61 [2020-10-15 18:55:45,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-15 18:55:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-15 18:55:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-15 18:55:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2020-10-15 18:55:45,859 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 22 [2020-10-15 18:55:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:45,860 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 96 transitions. [2020-10-15 18:55:45,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2020-10-15 18:55:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:45,860 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:45,861 INFO L422 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] [2020-10-15 18:55:45,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-15 18:55:45,861 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:45,861 INFO L82 PathProgramCache]: Analyzing trace with hash -882669411, now seen corresponding path program 23 times [2020-10-15 18:55:45,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:45,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802741652] [2020-10-15 18:55:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:46,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802741652] [2020-10-15 18:55:46,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:46,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:46,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718812587] [2020-10-15 18:55:46,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:46,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:46,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:46,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:46,512 INFO L87 Difference]: Start difference. First operand 61 states and 96 transitions. Second operand 14 states. [2020-10-15 18:55:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:47,447 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2020-10-15 18:55:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:47,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:47,448 INFO L225 Difference]: With dead ends: 109 [2020-10-15 18:55:47,449 INFO L226 Difference]: Without dead ends: 84 [2020-10-15 18:55:47,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-15 18:55:47,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2020-10-15 18:55:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-15 18:55:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 110 transitions. [2020-10-15 18:55:47,451 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 110 transitions. Word has length 22 [2020-10-15 18:55:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:47,452 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 110 transitions. [2020-10-15 18:55:47,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 110 transitions. [2020-10-15 18:55:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:47,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:47,452 INFO L422 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] [2020-10-15 18:55:47,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-15 18:55:47,453 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:47,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash -419341219, now seen corresponding path program 24 times [2020-10-15 18:55:47,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:47,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111417556] [2020-10-15 18:55:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:48,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111417556] [2020-10-15 18:55:48,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:48,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:48,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665797118] [2020-10-15 18:55:48,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:48,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:48,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:48,016 INFO L87 Difference]: Start difference. First operand 69 states and 110 transitions. Second operand 14 states. [2020-10-15 18:55:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:48,986 INFO L93 Difference]: Finished difference Result 115 states and 180 transitions. [2020-10-15 18:55:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-15 18:55:48,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:48,987 INFO L225 Difference]: With dead ends: 115 [2020-10-15 18:55:48,987 INFO L226 Difference]: Without dead ends: 98 [2020-10-15 18:55:48,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-15 18:55:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-15 18:55:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2020-10-15 18:55:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-15 18:55:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2020-10-15 18:55:48,989 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 22 [2020-10-15 18:55:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:48,989 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2020-10-15 18:55:48,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2020-10-15 18:55:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:48,990 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:48,990 INFO L422 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] [2020-10-15 18:55:48,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-15 18:55:48,990 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1366701539, now seen corresponding path program 25 times [2020-10-15 18:55:48,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:48,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30487594] [2020-10-15 18:55:48,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:49,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30487594] [2020-10-15 18:55:49,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:49,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:49,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172454832] [2020-10-15 18:55:49,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:49,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:49,569 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand 14 states. [2020-10-15 18:55:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:50,443 INFO L93 Difference]: Finished difference Result 107 states and 164 transitions. [2020-10-15 18:55:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 18:55:50,443 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:50,444 INFO L225 Difference]: With dead ends: 107 [2020-10-15 18:55:50,444 INFO L226 Difference]: Without dead ends: 88 [2020-10-15 18:55:50,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:50,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-15 18:55:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2020-10-15 18:55:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-15 18:55:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 102 transitions. [2020-10-15 18:55:50,448 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 102 transitions. Word has length 22 [2020-10-15 18:55:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:50,448 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 102 transitions. [2020-10-15 18:55:50,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 102 transitions. [2020-10-15 18:55:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:50,449 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:50,449 INFO L422 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] [2020-10-15 18:55:50,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-15 18:55:50,449 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:50,449 INFO L82 PathProgramCache]: Analyzing trace with hash -305746167, now seen corresponding path program 26 times [2020-10-15 18:55:50,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:50,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274269726] [2020-10-15 18:55:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:51,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274269726] [2020-10-15 18:55:51,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:51,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:51,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012485682] [2020-10-15 18:55:51,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:51,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:51,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:51,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:51,108 INFO L87 Difference]: Start difference. First operand 65 states and 102 transitions. Second operand 14 states. [2020-10-15 18:55:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:51,988 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2020-10-15 18:55:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:51,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:51,989 INFO L225 Difference]: With dead ends: 95 [2020-10-15 18:55:51,989 INFO L226 Difference]: Without dead ends: 59 [2020-10-15 18:55:51,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-15 18:55:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-15 18:55:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-15 18:55:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 92 transitions. [2020-10-15 18:55:51,992 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 92 transitions. Word has length 22 [2020-10-15 18:55:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:51,992 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 92 transitions. [2020-10-15 18:55:51,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 92 transitions. [2020-10-15 18:55:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:51,993 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:51,993 INFO L422 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] [2020-10-15 18:55:51,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-15 18:55:51,994 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2008695741, now seen corresponding path program 27 times [2020-10-15 18:55:51,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:51,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299889867] [2020-10-15 18:55:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:52,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299889867] [2020-10-15 18:55:52,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:52,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:52,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089500170] [2020-10-15 18:55:52,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:52,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:52,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:52,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:52,510 INFO L87 Difference]: Start difference. First operand 59 states and 92 transitions. Second operand 14 states. [2020-10-15 18:55:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:53,485 INFO L93 Difference]: Finished difference Result 88 states and 136 transitions. [2020-10-15 18:55:53,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:53,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:53,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:53,486 INFO L225 Difference]: With dead ends: 88 [2020-10-15 18:55:53,486 INFO L226 Difference]: Without dead ends: 63 [2020-10-15 18:55:53,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-15 18:55:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2020-10-15 18:55:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-15 18:55:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2020-10-15 18:55:53,489 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 22 [2020-10-15 18:55:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:53,490 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2020-10-15 18:55:53,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2020-10-15 18:55:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:53,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:53,490 INFO L422 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] [2020-10-15 18:55:53,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-15 18:55:53,491 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash 287585121, now seen corresponding path program 28 times [2020-10-15 18:55:53,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:53,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298652035] [2020-10-15 18:55:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:54,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298652035] [2020-10-15 18:55:54,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:54,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:54,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252336931] [2020-10-15 18:55:54,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:54,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:54,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:54,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:54,184 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand 14 states. [2020-10-15 18:55:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:55,265 INFO L93 Difference]: Finished difference Result 85 states and 125 transitions. [2020-10-15 18:55:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-15 18:55:55,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:55,267 INFO L225 Difference]: With dead ends: 85 [2020-10-15 18:55:55,267 INFO L226 Difference]: Without dead ends: 68 [2020-10-15 18:55:55,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-15 18:55:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-15 18:55:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2020-10-15 18:55:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-15 18:55:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2020-10-15 18:55:55,269 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 22 [2020-10-15 18:55:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:55,269 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2020-10-15 18:55:55,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2020-10-15 18:55:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:55,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:55,270 INFO L422 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] [2020-10-15 18:55:55,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-15 18:55:55,271 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:55,271 INFO L82 PathProgramCache]: Analyzing trace with hash -659775199, now seen corresponding path program 29 times [2020-10-15 18:55:55,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:55,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283224464] [2020-10-15 18:55:55,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:55,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283224464] [2020-10-15 18:55:55,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:55,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:55,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028510847] [2020-10-15 18:55:55,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:55,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:55,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:55,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:55,840 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand 14 states. [2020-10-15 18:55:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:56,705 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2020-10-15 18:55:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 18:55:56,706 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:56,707 INFO L225 Difference]: With dead ends: 77 [2020-10-15 18:55:56,707 INFO L226 Difference]: Without dead ends: 58 [2020-10-15 18:55:56,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-15 18:55:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2020-10-15 18:55:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-15 18:55:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2020-10-15 18:55:56,710 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 22 [2020-10-15 18:55:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:56,710 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2020-10-15 18:55:56,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2020-10-15 18:55:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:55:56,711 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:56,711 INFO L422 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] [2020-10-15 18:55:56,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-15 18:55:56,711 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:55:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:56,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1650897763, now seen corresponding path program 30 times [2020-10-15 18:55:56,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:56,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58223809] [2020-10-15 18:55:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:55:57,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58223809] [2020-10-15 18:55:57,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:57,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 18:55:57,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655539187] [2020-10-15 18:55:57,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-15 18:55:57,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:57,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-15 18:55:57,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:55:57,336 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand 14 states. [2020-10-15 18:55:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:58,216 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2020-10-15 18:55:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:58,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-15 18:55:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:58,217 INFO L225 Difference]: With dead ends: 48 [2020-10-15 18:55:58,217 INFO L226 Difference]: Without dead ends: 0 [2020-10-15 18:55:58,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:55:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-15 18:55:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-15 18:55:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-15 18:55:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-15 18:55:58,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-15 18:55:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:58,218 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-15 18:55:58,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-15 18:55:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-15 18:55:58,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-15 18:55:58,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-15 18:55:58,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:55:58 BasicIcfg [2020-10-15 18:55:58,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:55:58,224 INFO L168 Benchmark]: Toolchain (without parser) took 112755.00 ms. Allocated memory was 258.5 MB in the beginning and 662.7 MB in the end (delta: 404.2 MB). Free memory was 211.3 MB in the beginning and 211.3 MB in the end (delta: -17.7 kB). Peak memory consumption was 404.2 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:58,224 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 258.5 MB. Free memory is still 234.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:55:58,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1482.92 ms. Allocated memory was 258.5 MB in the beginning and 366.5 MB in the end (delta: 108.0 MB). Free memory was 211.3 MB in the beginning and 330.0 MB in the end (delta: -118.7 MB). Peak memory consumption was 110.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:58,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.27 ms. Allocated memory is still 366.5 MB. Free memory was 330.0 MB in the beginning and 326.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:58,225 INFO L168 Benchmark]: Boogie Preprocessor took 69.97 ms. Allocated memory is still 366.5 MB. Free memory was 326.8 MB in the beginning and 323.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:58,225 INFO L168 Benchmark]: RCFGBuilder took 696.37 ms. Allocated memory is still 366.5 MB. Free memory was 323.6 MB in the beginning and 275.8 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:58,226 INFO L168 Benchmark]: TraceAbstraction took 110424.20 ms. Allocated memory was 366.5 MB in the beginning and 662.7 MB in the end (delta: 296.2 MB). Free memory was 272.6 MB in the beginning and 211.3 MB in the end (delta: 61.3 MB). Peak memory consumption was 357.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:58,228 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 258.5 MB. Free memory is still 234.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1482.92 ms. Allocated memory was 258.5 MB in the beginning and 366.5 MB in the end (delta: 108.0 MB). Free memory was 211.3 MB in the beginning and 330.0 MB in the end (delta: -118.7 MB). Peak memory consumption was 110.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 75.27 ms. Allocated memory is still 366.5 MB. Free memory was 330.0 MB in the beginning and 326.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 69.97 ms. Allocated memory is still 366.5 MB. Free memory was 326.8 MB in the beginning and 323.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 14.2 GB. * RCFGBuilder took 696.37 ms. Allocated memory is still 366.5 MB. Free memory was 323.6 MB in the beginning and 275.8 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 110424.20 ms. Allocated memory was 366.5 MB in the beginning and 662.7 MB in the end (delta: 296.2 MB). Free memory was 272.6 MB in the beginning and 211.3 MB in the end (delta: 61.3 MB). Peak memory consumption was 357.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1927 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 22 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 47.9s, 164 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 56.9s, 151 PlacesBefore, 41 PlacesAfterwards, 155 TransitionsBefore, 40 TransitionsAfterwards, 2884 CoEnabledTransitionPairs, 7 FixpointIterations, 87 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 167 TotalNumberOfCompositions, 6656 MoverChecksTotal - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 110.2s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 56.9s, HoareTripleCheckerStatistics: 854 SDtfs, 1700 SDslu, 4176 SDs, 0 SdLazy, 10914 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 23 SyntacticMatches, 72 SemanticMatches, 649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 31.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 40 MinimizatonAttempts, 742 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 414148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...