/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-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 15:26:28,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:26:28,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:26:28,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:26:28,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:26:28,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:26:28,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:26:28,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:26:28,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:26:28,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:26:28,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:26:28,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:26:28,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:26:28,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:26:28,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:26:28,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:26:28,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:26:28,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:26:28,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:26:28,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:26:28,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:26:28,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:26:28,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:26:28,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:26:28,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:26:28,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:26:28,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:26:28,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:26:28,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:26:28,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:26:28,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:26:28,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:26:28,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:26:28,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:26:28,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:26:28,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:26:28,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:26:28,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:26:28,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:26:28,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:26:28,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:26:28,267 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-11 15:26:28,304 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:26:28,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:26:28,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:26:28,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:26:28,306 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:26:28,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:26:28,306 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:26:28,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:26:28,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:26:28,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:26:28,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:26:28,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:26:28,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:26:28,307 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:26:28,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:26:28,308 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:26:28,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:26:28,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:26:28,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:26:28,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:26:28,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:26:28,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:26:28,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:26:28,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:26:28,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:26:28,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:26:28,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:26:28,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:26:28,310 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:26:28,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:26:28,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:26:28,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:26:28,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:26:28,616 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:26:28,617 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:26:28,617 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-11 15:26:28,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7bc36bd9/947ccfee528142dd84958089cdf884c4/FLAG8a91f12dd [2020-10-11 15:26:29,333 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:26:29,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-11 15:26:29,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7bc36bd9/947ccfee528142dd84958089cdf884c4/FLAG8a91f12dd [2020-10-11 15:26:29,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7bc36bd9/947ccfee528142dd84958089cdf884c4 [2020-10-11 15:26:29,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:26:29,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:26:29,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:26:29,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:26:29,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:26:29,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:26:29" (1/1) ... [2020-10-11 15:26:29,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@440c3668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:29, skipping insertion in model container [2020-10-11 15:26:29,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:26:29" (1/1) ... [2020-10-11 15:26:29,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:26:29,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:26:30,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:26:30,500 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:26:30,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:26:31,047 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:26:31,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31 WrapperNode [2020-10-11 15:26:31,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:26:31,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:26:31,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:26:31,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:26:31,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (1/1) ... [2020-10-11 15:26:31,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (1/1) ... [2020-10-11 15:26:31,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:26:31,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:26:31,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:26:31,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:26:31,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (1/1) ... [2020-10-11 15:26:31,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (1/1) ... [2020-10-11 15:26:31,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (1/1) ... [2020-10-11 15:26:31,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (1/1) ... [2020-10-11 15:26:31,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (1/1) ... [2020-10-11 15:26:31,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (1/1) ... [2020-10-11 15:26:31,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (1/1) ... [2020-10-11 15:26:31,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:26:31,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:26:31,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:26:31,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:26:31,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (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-11 15:26:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:26:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-11 15:26:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-11 15:26:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-11 15:26:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:26:31,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:26:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-11 15:26:31,284 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-11 15:26:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:26:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:26:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-11 15:26:31,286 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:26:31,918 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:26:31,919 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-11 15:26:31,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:31 BoogieIcfgContainer [2020-10-11 15:26:31,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:26:31,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:26:31,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:26:31,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:26:31,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:26:29" (1/3) ... [2020-10-11 15:26:31,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b07fb6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:31, skipping insertion in model container [2020-10-11 15:26:31,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:31" (2/3) ... [2020-10-11 15:26:31,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b07fb6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:31, skipping insertion in model container [2020-10-11 15:26:31,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:31" (3/3) ... [2020-10-11 15:26:31,930 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-10-11 15:26:31,942 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:26:31,942 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:26:31,950 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-11 15:26:31,951 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:26:31,982 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,983 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,983 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,983 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,983 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,983 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,984 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,984 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,984 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,984 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,984 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,985 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,985 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,985 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,985 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,985 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,986 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,986 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,986 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,986 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,986 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,987 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,987 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,987 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,987 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,988 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,988 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,988 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,988 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,988 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,989 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,989 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,989 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,989 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,989 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,990 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,990 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,990 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,990 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,990 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,990 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,991 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,991 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,991 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,992 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,992 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,992 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,992 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,993 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,993 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,993 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,993 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,993 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,994 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,994 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,994 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,994 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,994 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,998 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,998 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,999 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,999 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,999 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,999 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:31,999 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,000 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,000 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,000 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,011 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,012 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,012 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,012 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,012 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,012 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,012 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,013 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,013 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,013 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:32,037 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-11 15:26:32,058 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:26:32,058 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:26:32,058 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:26:32,058 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:26:32,058 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:26:32,059 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:26:32,059 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:26:32,059 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:26:32,076 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:26:32,079 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions, 330 flow [2020-10-11 15:26:32,082 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 154 transitions, 330 flow [2020-10-11 15:26:32,084 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-10-11 15:26:32,155 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-10-11 15:26:32,156 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-11 15:26:32,163 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-11 15:26:32,168 INFO L117 LiptonReduction]: Number of co-enabled transitions 2652 [2020-10-11 15:26:32,391 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-11 15:26:32,419 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:32,425 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-11 15:26:32,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:32,448 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-11 15:26:32,448 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:26:32,464 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-11 15:26:32,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:32,493 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-11 15:26:32,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:32,515 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-11 15:26:32,516 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:34,773 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-11 15:26:34,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,804 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-11 15:26:34,825 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,826 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-11 15:26:34,827 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:26:34,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-11 15:26:34,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,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-11 15:26:34,899 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,901 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-11 15:26:34,901 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:36,942 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-11 15:26:36,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:36,974 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-11 15:26:37,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:37,001 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-11 15:26:37,002 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-11 15:26:37,016 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-11 15:26:37,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:37,046 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-11 15:26:37,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:37,069 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-11 15:26:37,069 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:26:39,146 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-11 15:26:39,177 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:39,182 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-11 15:26:39,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:39,206 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-11 15:26:39,207 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:39,232 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-11 15:26:39,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:39,262 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-11 15:26:39,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:39,285 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-11 15:26:39,286 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:41,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-11 15:26:41,536 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:41,541 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-11 15:26:41,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:41,565 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-11 15:26:41,566 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:41,580 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-11 15:26:41,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:41,615 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-11 15:26:41,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:41,638 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-11 15:26:41,638 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:26:43,970 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-11 15:26:43,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:43,999 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-11 15:26:44,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:44,018 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-11 15:26:44,018 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:44,032 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-11 15:26:44,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:44,061 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-11 15:26:44,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:44,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-11 15:26:44,081 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:46,279 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-11 15:26:46,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:46,318 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-11 15:26:46,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:46,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-11 15:26:46,343 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2020-10-11 15:26:46,384 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-11 15:26:46,410 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:46,416 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-11 15:26:46,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:46,440 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-11 15:26:46,441 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:46,467 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-11 15:26:46,493 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:46,496 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-11 15:26:46,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:46,519 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-11 15:26:46,519 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:26:48,602 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-11 15:26:48,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:48,632 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-11 15:26:48,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:48,657 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-11 15:26:48,657 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:26:48,678 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-11 15:26:48,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:48,715 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-11 15:26:48,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:48,739 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-11 15:26:48,739 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:50,770 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-11 15:26:50,794 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:50,797 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-11 15:26:50,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:50,819 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-11 15:26:50,820 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:50,831 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-11 15:26:50,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:50,860 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-11 15:26:50,906 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:50,907 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-11 15:26:50,907 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:52,952 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-11 15:26:52,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:52,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-11 15:26:53,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:53,018 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-11 15:26:53,018 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:53,033 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-11 15:26:53,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:53,070 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-11 15:26:53,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:53,102 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-11 15:26:53,103 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:26:55,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-11 15:26:55,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:55,150 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-11 15:26:55,168 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:55,169 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-11 15:26:55,170 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:55,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-11 15:26:55,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:55,221 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-11 15:26:55,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:55,239 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-11 15:26:55,240 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:57,602 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-11 15:26:57,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:57,626 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-11 15:26:57,643 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:57,644 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-11 15:26:57,645 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:26:57,654 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-11 15:26:57,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:57,682 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-11 15:26:57,697 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:57,698 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-11 15:26:57,698 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-11 15:26:59,716 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-11 15:26:59,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:59,748 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-11 15:26:59,775 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:59,776 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-11 15:26:59,777 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:59,794 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-11 15:26:59,830 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:59,834 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-11 15:26:59,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:59,865 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-11 15:26:59,865 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:27:02,122 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-11 15:27:02,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:02,149 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-11 15:27:02,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:02,167 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-11 15:27:02,168 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:27:02,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-11 15:27:02,206 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:02,210 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-11 15:27:02,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:02,230 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-11 15:27:02,231 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:27:04,542 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-11 15:27:04,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,570 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-11 15:27:04,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,588 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-11 15:27:04,588 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:27:04,607 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-11 15:27:04,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,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-11 15:27:04,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,662 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-11 15:27:04,662 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:27:06,820 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-11 15:27:06,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:06,843 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-11 15:27:06,859 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:06,860 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-11 15:27:06,860 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-11 15:27:06,878 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-11 15:27:06,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:06,900 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-11 15:27:06,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:06,917 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-11 15:27:06,917 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:27:08,947 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-11 15:27:08,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:08,973 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-11 15:27:08,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:08,991 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-11 15:27:08,992 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:27:09,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-11 15:27:09,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:09,035 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-11 15:27:09,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:09,060 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-11 15:27:09,061 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:27:11,185 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-11 15:27:11,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:11,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-11 15:27:11,231 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:11,232 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-11 15:27:11,232 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:27:11,244 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-11 15:27:11,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:11,270 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-11 15:27:11,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:11,291 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-11 15:27:11,291 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:27:13,349 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-11 15:27:13,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:13,375 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-11 15:27:13,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:13,390 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-11 15:27:13,391 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:27:13,397 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-11 15:27:13,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:13,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-11 15:27:13,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:13,439 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-11 15:27:13,439 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:27:15,510 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-11 15:27:15,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:15,535 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-11 15:27:15,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:15,558 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-11 15:27:15,558 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:27:15,568 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-11 15:27:15,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:15,592 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-11 15:27:15,608 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:15,608 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-11 15:27:15,609 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-11 15:27:17,796 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-11 15:27:17,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:17,824 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-11 15:27:17,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:17,844 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-11 15:27:17,845 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-11 15:27:17,854 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-11 15:27:17,878 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:17,883 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-11 15:27:17,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:17,906 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-11 15:27:17,906 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:27:20,046 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-11 15:27:20,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:20,066 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-11 15:27:20,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:20,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-11 15:27:20,081 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-11 15:27:20,107 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-11 15:27:20,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:20,151 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-11 15:27:20,179 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:20,180 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-11 15:27:20,181 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:27:20,194 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-11 15:27:20,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:20,235 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-11 15:27:20,274 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:20,275 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-11 15:27:20,276 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:27:22,311 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-11 15:27:22,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:22,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-11 15:27:22,358 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:22,359 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-11 15:27:22,359 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:27:22,369 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-11 15:27:22,410 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:22,414 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-11 15:27:22,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:22,439 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-11 15:27:22,440 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:27:24,463 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-11 15:27:24,482 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:24,487 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-11 15:27:24,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:24,514 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-11 15:27:24,514 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:27:24,526 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-11 15:27:24,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:24,549 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-11 15:27:24,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:24,565 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-11 15:27:24,565 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:27:28,090 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-10-11 15:27:28,197 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-11 15:27:28,602 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-10-11 15:27:28,628 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-11 15:27:28,828 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-11 15:27:28,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:28,835 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-11 15:27:29,018 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-11 15:27:29,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:29,019 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-11 15:27:29,019 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2020-10-11 15:27:29,210 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-11 15:27:30,461 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-11 15:27:30,870 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-11 15:27:31,410 WARN L193 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-11 15:27:31,642 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-11 15:27:31,655 INFO L132 LiptonReduction]: Checked pairs total: 6338 [2020-10-11 15:27:31,656 INFO L134 LiptonReduction]: Total number of compositions: 174 [2020-10-11 15:27:31,662 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2020-10-11 15:27:31,693 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2020-10-11 15:27:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2020-10-11 15:27:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-11 15:27:31,701 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:31,702 INFO L421 BasicCegarLoop]: trace histogram [1] [2020-10-11 15:27:31,702 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-11 15:27:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:31,708 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2020-10-11 15:27:31,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:31,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031495103] [2020-10-11 15:27:31,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:31,939 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-11 15:27:31,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031495103] [2020-10-11 15:27:31,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:31,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-11 15:27:31,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428092634] [2020-10-11 15:27:31,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-11 15:27:31,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-11 15:27:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-11 15:27:31,964 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2020-10-11 15:27:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:32,000 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2020-10-11 15:27:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-11 15:27:32,001 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-11 15:27:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:32,018 INFO L225 Difference]: With dead ends: 386 [2020-10-11 15:27:32,018 INFO L226 Difference]: Without dead ends: 348 [2020-10-11 15:27:32,019 INFO L673 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-11 15:27:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-10-11 15:27:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2020-10-11 15:27:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-10-11 15:27:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2020-10-11 15:27:32,096 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2020-10-11 15:27:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:32,097 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2020-10-11 15:27:32,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-11 15:27:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2020-10-11 15:27:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-11 15:27:32,097 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:32,097 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-11 15:27:32,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:27:32,098 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-11 15:27:32,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 1 times [2020-10-11 15:27:32,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:32,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387454867] [2020-10-11 15:27:32,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:32,337 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-11 15:27:32,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387454867] [2020-10-11 15:27:32,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:32,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:27:32,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912214864] [2020-10-11 15:27:32,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:27:32,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:27:32,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:27:32,340 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2020-10-11 15:27:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:32,452 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2020-10-11 15:27:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:27:32,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-11 15:27:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:32,460 INFO L225 Difference]: With dead ends: 471 [2020-10-11 15:27:32,460 INFO L226 Difference]: Without dead ends: 471 [2020-10-11 15:27:32,461 INFO L673 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-11 15:27:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-10-11 15:27:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2020-10-11 15:27:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-11 15:27:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2020-10-11 15:27:32,493 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2020-10-11 15:27:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:32,493 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2020-10-11 15:27:32,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:27:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2020-10-11 15:27:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-11 15:27:32,494 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:32,494 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-11 15:27:32,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:27:32,494 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-11 15:27:32,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:32,495 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 1 times [2020-10-11 15:27:32,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:32,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055966184] [2020-10-11 15:27:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:32,616 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-11 15:27:32,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055966184] [2020-10-11 15:27:32,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:32,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:27:32,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559420825] [2020-10-11 15:27:32,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:27:32,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:32,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:27:32,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:27:32,621 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2020-10-11 15:27:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:32,701 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2020-10-11 15:27:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:27:32,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-11 15:27:32,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:32,706 INFO L225 Difference]: With dead ends: 498 [2020-10-11 15:27:32,706 INFO L226 Difference]: Without dead ends: 482 [2020-10-11 15:27:32,707 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:27:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-11 15:27:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2020-10-11 15:27:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-11 15:27:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2020-10-11 15:27:32,729 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2020-10-11 15:27:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:32,729 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2020-10-11 15:27:32,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:27:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2020-10-11 15:27:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-11 15:27:32,731 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:32,731 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:32,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:27:32,731 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-11 15:27:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 1 times [2020-10-11 15:27:32,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:32,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221503051] [2020-10-11 15:27:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:32,801 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-11 15:27:32,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221503051] [2020-10-11 15:27:32,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:32,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:27:32,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108531546] [2020-10-11 15:27:32,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:27:32,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:32,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:27:32,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:27:32,804 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2020-10-11 15:27:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:32,823 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-11 15:27:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:27:32,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-11 15:27:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:32,826 INFO L225 Difference]: With dead ends: 162 [2020-10-11 15:27:32,826 INFO L226 Difference]: Without dead ends: 162 [2020-10-11 15:27:32,826 INFO L673 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-11 15:27:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-11 15:27:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-11 15:27:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-11 15:27:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-11 15:27:32,831 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-11 15:27:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:32,832 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-11 15:27:32,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:27:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-11 15:27:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:32,834 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:32,835 INFO L421 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-11 15:27:32,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:27:32,835 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-11 15:27:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 1 times [2020-10-11 15:27:32,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:32,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940484687] [2020-10-11 15:27:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:32,986 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-11 15:27:32,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940484687] [2020-10-11 15:27:32,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:32,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:27:32,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622623823] [2020-10-11 15:27:32,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:27:32,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:27:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:27:32,988 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2020-10-11 15:27:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:33,142 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2020-10-11 15:27:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:27:33,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-11 15:27:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:33,144 INFO L225 Difference]: With dead ends: 206 [2020-10-11 15:27:33,145 INFO L226 Difference]: Without dead ends: 206 [2020-10-11 15:27:33,145 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:27:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-11 15:27:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2020-10-11 15:27:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-11 15:27:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2020-10-11 15:27:33,151 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2020-10-11 15:27:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:33,151 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2020-10-11 15:27:33,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:27:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2020-10-11 15:27:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:33,153 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:33,154 INFO L421 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-11 15:27:33,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:27:33,154 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-11 15:27:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:33,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 1 times [2020-10-11 15:27:33,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:33,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88315294] [2020-10-11 15:27:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:33,870 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-11 15:27:33,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88315294] [2020-10-11 15:27:33,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:33,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:33,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525267383] [2020-10-11 15:27:33,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:33,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:33,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:33,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:33,876 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 12 states. [2020-10-11 15:27:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:35,160 INFO L93 Difference]: Finished difference Result 314 states and 604 transitions. [2020-10-11 15:27:35,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 15:27:35,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:35,162 INFO L225 Difference]: With dead ends: 314 [2020-10-11 15:27:35,163 INFO L226 Difference]: Without dead ends: 314 [2020-10-11 15:27:35,163 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-11 15:27:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 248. [2020-10-11 15:27:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-11 15:27:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 493 transitions. [2020-10-11 15:27:35,171 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 493 transitions. Word has length 22 [2020-10-11 15:27:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:35,172 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 493 transitions. [2020-10-11 15:27:35,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 493 transitions. [2020-10-11 15:27:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:35,173 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:35,173 INFO L421 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-11 15:27:35,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:27:35,174 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-11 15:27:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 1 times [2020-10-11 15:27:35,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:35,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678972258] [2020-10-11 15:27:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:35,445 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-11 15:27:35,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678972258] [2020-10-11 15:27:35,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:35,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 15:27:35,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071718639] [2020-10-11 15:27:35,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:27:35,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:35,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:27:35,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:27:35,447 INFO L87 Difference]: Start difference. First operand 248 states and 493 transitions. Second operand 8 states. [2020-10-11 15:27:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:35,811 INFO L93 Difference]: Finished difference Result 369 states and 697 transitions. [2020-10-11 15:27:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:27:35,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-11 15:27:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:35,814 INFO L225 Difference]: With dead ends: 369 [2020-10-11 15:27:35,814 INFO L226 Difference]: Without dead ends: 319 [2020-10-11 15:27:35,814 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-10-11 15:27:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 247. [2020-10-11 15:27:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-11 15:27:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 491 transitions. [2020-10-11 15:27:35,824 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 491 transitions. Word has length 22 [2020-10-11 15:27:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:35,824 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 491 transitions. [2020-10-11 15:27:35,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:27:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 491 transitions. [2020-10-11 15:27:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:35,826 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:35,826 INFO L421 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-11 15:27:35,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:27:35,826 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-11 15:27:35,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732572, now seen corresponding path program 2 times [2020-10-11 15:27:35,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:35,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481276786] [2020-10-11 15:27:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:35,943 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-11 15:27:35,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481276786] [2020-10-11 15:27:35,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:35,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:27:35,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924528377] [2020-10-11 15:27:35,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:27:35,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:35,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:27:35,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:27:35,945 INFO L87 Difference]: Start difference. First operand 247 states and 491 transitions. Second operand 4 states. [2020-10-11 15:27:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:35,971 INFO L93 Difference]: Finished difference Result 162 states and 259 transitions. [2020-10-11 15:27:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:27:35,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-11 15:27:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:35,972 INFO L225 Difference]: With dead ends: 162 [2020-10-11 15:27:35,972 INFO L226 Difference]: Without dead ends: 157 [2020-10-11 15:27:35,973 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:27:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-11 15:27:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2020-10-11 15:27:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-11 15:27:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 253 transitions. [2020-10-11 15:27:35,977 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 253 transitions. Word has length 22 [2020-10-11 15:27:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:35,977 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 253 transitions. [2020-10-11 15:27:35,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:27:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 253 transitions. [2020-10-11 15:27:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:35,978 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:35,978 INFO L421 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-11 15:27:35,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:27:35,979 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-11 15:27:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:35,979 INFO L82 PathProgramCache]: Analyzing trace with hash 472795278, now seen corresponding path program 2 times [2020-10-11 15:27:35,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:35,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326043021] [2020-10-11 15:27:35,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:36,100 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-11 15:27:36,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326043021] [2020-10-11 15:27:36,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:36,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:27:36,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897052387] [2020-10-11 15:27:36,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:27:36,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:36,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:27:36,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:27:36,102 INFO L87 Difference]: Start difference. First operand 156 states and 253 transitions. Second operand 8 states. [2020-10-11 15:27:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:36,384 INFO L93 Difference]: Finished difference Result 151 states and 239 transitions. [2020-10-11 15:27:36,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:27:36,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-11 15:27:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:36,386 INFO L225 Difference]: With dead ends: 151 [2020-10-11 15:27:36,386 INFO L226 Difference]: Without dead ends: 151 [2020-10-11 15:27:36,386 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-10-11 15:27:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2020-10-11 15:27:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-11 15:27:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2020-10-11 15:27:36,390 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 22 [2020-10-11 15:27:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:36,391 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2020-10-11 15:27:36,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:27:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2020-10-11 15:27:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:36,392 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:36,392 INFO L421 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-11 15:27:36,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:27:36,392 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-11 15:27:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1729521388, now seen corresponding path program 3 times [2020-10-11 15:27:36,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:36,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493194756] [2020-10-11 15:27:36,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:37,023 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-11 15:27:37,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493194756] [2020-10-11 15:27:37,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:37,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:37,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372373845] [2020-10-11 15:27:37,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:37,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:37,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:37,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:37,025 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand 12 states. [2020-10-11 15:27:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:37,717 INFO L93 Difference]: Finished difference Result 144 states and 221 transitions. [2020-10-11 15:27:37,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:37,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:37,719 INFO L225 Difference]: With dead ends: 144 [2020-10-11 15:27:37,719 INFO L226 Difference]: Without dead ends: 131 [2020-10-11 15:27:37,720 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-10-11 15:27:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-11 15:27:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2020-10-11 15:27:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-11 15:27:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 207 transitions. [2020-10-11 15:27:37,724 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 207 transitions. Word has length 22 [2020-10-11 15:27:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:37,724 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 207 transitions. [2020-10-11 15:27:37,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 207 transitions. [2020-10-11 15:27:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:37,725 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:37,725 INFO L421 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-11 15:27:37,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 15:27:37,726 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-11 15:27:37,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:37,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1321376162, now seen corresponding path program 4 times [2020-10-11 15:27:37,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:37,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205832515] [2020-10-11 15:27:37,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:38,246 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-11 15:27:38,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205832515] [2020-10-11 15:27:38,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:38,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:38,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042941387] [2020-10-11 15:27:38,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:38,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:38,248 INFO L87 Difference]: Start difference. First operand 130 states and 207 transitions. Second operand 12 states. [2020-10-11 15:27:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:39,012 INFO L93 Difference]: Finished difference Result 142 states and 218 transitions. [2020-10-11 15:27:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 15:27:39,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:39,013 INFO L225 Difference]: With dead ends: 142 [2020-10-11 15:27:39,013 INFO L226 Difference]: Without dead ends: 130 [2020-10-11 15:27:39,014 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-11 15:27:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-11 15:27:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-11 15:27:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-11 15:27:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 205 transitions. [2020-10-11 15:27:39,020 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 205 transitions. Word has length 22 [2020-10-11 15:27:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:39,021 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 205 transitions. [2020-10-11 15:27:39,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 205 transitions. [2020-10-11 15:27:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:39,023 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:39,023 INFO L421 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-11 15:27:39,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 15:27:39,023 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-11 15:27:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:39,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400266, now seen corresponding path program 5 times [2020-10-11 15:27:39,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:39,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191298545] [2020-10-11 15:27:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:39,574 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-11 15:27:39,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191298545] [2020-10-11 15:27:39,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:39,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:39,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035154596] [2020-10-11 15:27:39,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:39,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:39,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:39,576 INFO L87 Difference]: Start difference. First operand 130 states and 205 transitions. Second operand 12 states. [2020-10-11 15:27:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:40,303 INFO L93 Difference]: Finished difference Result 149 states and 230 transitions. [2020-10-11 15:27:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 15:27:40,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:40,304 INFO L225 Difference]: With dead ends: 149 [2020-10-11 15:27:40,305 INFO L226 Difference]: Without dead ends: 149 [2020-10-11 15:27:40,305 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-11 15:27:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2020-10-11 15:27:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-11 15:27:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2020-10-11 15:27:40,309 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 22 [2020-10-11 15:27:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:40,310 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2020-10-11 15:27:40,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2020-10-11 15:27:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:40,311 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:40,311 INFO L421 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-11 15:27:40,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 15:27:40,311 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-11 15:27:40,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:40,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400276, now seen corresponding path program 2 times [2020-10-11 15:27:40,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:40,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463806778] [2020-10-11 15:27:40,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:40,456 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-11 15:27:40,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463806778] [2020-10-11 15:27:40,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:40,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 15:27:40,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848808917] [2020-10-11 15:27:40,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:27:40,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:40,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:27:40,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:27:40,458 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand 8 states. [2020-10-11 15:27:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:40,729 INFO L93 Difference]: Finished difference Result 191 states and 287 transitions. [2020-10-11 15:27:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:27:40,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-11 15:27:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:40,731 INFO L225 Difference]: With dead ends: 191 [2020-10-11 15:27:40,732 INFO L226 Difference]: Without dead ends: 165 [2020-10-11 15:27:40,732 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-11 15:27:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 128. [2020-10-11 15:27:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-11 15:27:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 199 transitions. [2020-10-11 15:27:40,737 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 199 transitions. Word has length 22 [2020-10-11 15:27:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:40,740 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 199 transitions. [2020-10-11 15:27:40,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:27:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2020-10-11 15:27:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:40,741 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:40,742 INFO L421 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-11 15:27:40,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 15:27:40,742 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-11 15:27:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2057875200, now seen corresponding path program 3 times [2020-10-11 15:27:40,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:40,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035233751] [2020-10-11 15:27:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:40,981 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-11 15:27:40,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035233751] [2020-10-11 15:27:40,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:40,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:40,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781761713] [2020-10-11 15:27:40,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:27:40,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:40,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:27:40,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:27:40,983 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand 11 states. [2020-10-11 15:27:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:41,604 INFO L93 Difference]: Finished difference Result 245 states and 383 transitions. [2020-10-11 15:27:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 15:27:41,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-11 15:27:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:41,606 INFO L225 Difference]: With dead ends: 245 [2020-10-11 15:27:41,607 INFO L226 Difference]: Without dead ends: 230 [2020-10-11 15:27:41,607 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2020-10-11 15:27:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-11 15:27:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 141. [2020-10-11 15:27:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-11 15:27:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 227 transitions. [2020-10-11 15:27:41,612 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 227 transitions. Word has length 22 [2020-10-11 15:27:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:41,612 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 227 transitions. [2020-10-11 15:27:41,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:27:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 227 transitions. [2020-10-11 15:27:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:41,613 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:41,613 INFO L421 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-11 15:27:41,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 15:27:41,614 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-11 15:27:41,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:41,614 INFO L82 PathProgramCache]: Analyzing trace with hash -761551564, now seen corresponding path program 6 times [2020-10-11 15:27:41,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:41,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546788651] [2020-10-11 15:27:41,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:42,069 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-11 15:27:42,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546788651] [2020-10-11 15:27:42,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:42,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:42,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093899019] [2020-10-11 15:27:42,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:42,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:42,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:42,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:42,072 INFO L87 Difference]: Start difference. First operand 141 states and 227 transitions. Second operand 12 states. [2020-10-11 15:27:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:42,691 INFO L93 Difference]: Finished difference Result 148 states and 233 transitions. [2020-10-11 15:27:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 15:27:42,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:42,693 INFO L225 Difference]: With dead ends: 148 [2020-10-11 15:27:42,693 INFO L226 Difference]: Without dead ends: 137 [2020-10-11 15:27:42,694 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-11 15:27:42,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-11 15:27:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-11 15:27:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 219 transitions. [2020-10-11 15:27:42,699 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 219 transitions. Word has length 22 [2020-10-11 15:27:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:42,699 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 219 transitions. [2020-10-11 15:27:42,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 219 transitions. [2020-10-11 15:27:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:42,700 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:42,700 INFO L421 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-11 15:27:42,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 15:27:42,700 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-11 15:27:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1314893868, now seen corresponding path program 7 times [2020-10-11 15:27:42,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:42,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048791938] [2020-10-11 15:27:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:43,209 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-11 15:27:43,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048791938] [2020-10-11 15:27:43,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:43,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:43,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796700544] [2020-10-11 15:27:43,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:43,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:43,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:43,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:43,211 INFO L87 Difference]: Start difference. First operand 137 states and 219 transitions. Second operand 12 states. [2020-10-11 15:27:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:43,829 INFO L93 Difference]: Finished difference Result 145 states and 226 transitions. [2020-10-11 15:27:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 15:27:43,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:43,831 INFO L225 Difference]: With dead ends: 145 [2020-10-11 15:27:43,831 INFO L226 Difference]: Without dead ends: 121 [2020-10-11 15:27:43,832 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-11 15:27:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-11 15:27:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-11 15:27:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 194 transitions. [2020-10-11 15:27:43,835 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 194 transitions. Word has length 22 [2020-10-11 15:27:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:43,835 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 194 transitions. [2020-10-11 15:27:43,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 194 transitions. [2020-10-11 15:27:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:43,836 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:43,836 INFO L421 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-11 15:27:43,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 15:27:43,837 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-11 15:27:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash -149449002, now seen corresponding path program 8 times [2020-10-11 15:27:43,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:43,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121701262] [2020-10-11 15:27:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:44,377 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-11 15:27:44,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121701262] [2020-10-11 15:27:44,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:44,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:44,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781473841] [2020-10-11 15:27:44,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:44,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:44,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:44,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:44,379 INFO L87 Difference]: Start difference. First operand 121 states and 194 transitions. Second operand 12 states. [2020-10-11 15:27:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:44,978 INFO L93 Difference]: Finished difference Result 121 states and 193 transitions. [2020-10-11 15:27:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 15:27:44,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:44,980 INFO L225 Difference]: With dead ends: 121 [2020-10-11 15:27:44,980 INFO L226 Difference]: Without dead ends: 106 [2020-10-11 15:27:44,980 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-11 15:27:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-11 15:27:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-11 15:27:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 178 transitions. [2020-10-11 15:27:44,984 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 178 transitions. Word has length 22 [2020-10-11 15:27:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:44,984 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 178 transitions. [2020-10-11 15:27:44,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 178 transitions. [2020-10-11 15:27:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:44,985 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:44,985 INFO L421 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-11 15:27:44,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 15:27:44,985 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-11 15:27:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash -552633476, now seen corresponding path program 9 times [2020-10-11 15:27:44,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:44,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840927327] [2020-10-11 15:27:44,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:45,548 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-11 15:27:45,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840927327] [2020-10-11 15:27:45,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:45,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:45,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194212356] [2020-10-11 15:27:45,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:45,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:45,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:45,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:45,551 INFO L87 Difference]: Start difference. First operand 106 states and 178 transitions. Second operand 12 states. [2020-10-11 15:27:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:46,133 INFO L93 Difference]: Finished difference Result 137 states and 223 transitions. [2020-10-11 15:27:46,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 15:27:46,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:46,135 INFO L225 Difference]: With dead ends: 137 [2020-10-11 15:27:46,135 INFO L226 Difference]: Without dead ends: 137 [2020-10-11 15:27:46,136 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-11 15:27:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2020-10-11 15:27:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-11 15:27:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 223 transitions. [2020-10-11 15:27:46,140 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 223 transitions. Word has length 22 [2020-10-11 15:27:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:46,140 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 223 transitions. [2020-10-11 15:27:46,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 223 transitions. [2020-10-11 15:27:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:46,141 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:46,141 INFO L421 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-11 15:27:46,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 15:27:46,142 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-11 15:27:46,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:46,142 INFO L82 PathProgramCache]: Analyzing trace with hash -552633486, now seen corresponding path program 3 times [2020-10-11 15:27:46,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:46,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110647293] [2020-10-11 15:27:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:46,283 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-11 15:27:46,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110647293] [2020-10-11 15:27:46,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:46,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 15:27:46,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331287456] [2020-10-11 15:27:46,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:27:46,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:27:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:27:46,285 INFO L87 Difference]: Start difference. First operand 136 states and 223 transitions. Second operand 8 states. [2020-10-11 15:27:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:46,638 INFO L93 Difference]: Finished difference Result 166 states and 269 transitions. [2020-10-11 15:27:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:27:46,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-11 15:27:46,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:46,640 INFO L225 Difference]: With dead ends: 166 [2020-10-11 15:27:46,640 INFO L226 Difference]: Without dead ends: 135 [2020-10-11 15:27:46,641 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-11 15:27:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-10-11 15:27:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-11 15:27:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 223 transitions. [2020-10-11 15:27:46,645 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 223 transitions. Word has length 22 [2020-10-11 15:27:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:46,646 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 223 transitions. [2020-10-11 15:27:46,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:27:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 223 transitions. [2020-10-11 15:27:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:46,647 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:46,647 INFO L421 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-11 15:27:46,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 15:27:46,648 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-11 15:27:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:46,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1930461660, now seen corresponding path program 10 times [2020-10-11 15:27:46,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:46,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279739083] [2020-10-11 15:27:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:47,107 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-10-11 15:27:47,622 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-11 15:27:47,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279739083] [2020-10-11 15:27:47,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:47,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:47,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413328626] [2020-10-11 15:27:47,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:47,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:47,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:47,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:47,627 INFO L87 Difference]: Start difference. First operand 135 states and 223 transitions. Second operand 12 states. [2020-10-11 15:27:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:48,402 INFO L93 Difference]: Finished difference Result 174 states and 282 transitions. [2020-10-11 15:27:48,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 15:27:48,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:48,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:48,404 INFO L225 Difference]: With dead ends: 174 [2020-10-11 15:27:48,404 INFO L226 Difference]: Without dead ends: 132 [2020-10-11 15:27:48,405 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-11 15:27:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-11 15:27:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-11 15:27:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 216 transitions. [2020-10-11 15:27:48,409 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 216 transitions. Word has length 22 [2020-10-11 15:27:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:48,409 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 216 transitions. [2020-10-11 15:27:48,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 216 transitions. [2020-10-11 15:27:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:48,410 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:48,410 INFO L421 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-11 15:27:48,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 15:27:48,410 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-11 15:27:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:48,411 INFO L82 PathProgramCache]: Analyzing trace with hash 571806310, now seen corresponding path program 11 times [2020-10-11 15:27:48,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:48,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660362729] [2020-10-11 15:27:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:49,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-11 15:27:49,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660362729] [2020-10-11 15:27:49,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:49,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:49,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586197762] [2020-10-11 15:27:49,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:49,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:49,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:49,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:49,016 INFO L87 Difference]: Start difference. First operand 132 states and 216 transitions. Second operand 12 states. [2020-10-11 15:27:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:49,734 INFO L93 Difference]: Finished difference Result 169 states and 273 transitions. [2020-10-11 15:27:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 15:27:49,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:49,736 INFO L225 Difference]: With dead ends: 169 [2020-10-11 15:27:49,736 INFO L226 Difference]: Without dead ends: 132 [2020-10-11 15:27:49,736 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-11 15:27:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-11 15:27:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-11 15:27:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 212 transitions. [2020-10-11 15:27:49,740 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 212 transitions. Word has length 22 [2020-10-11 15:27:49,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:49,741 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 212 transitions. [2020-10-11 15:27:49,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 212 transitions. [2020-10-11 15:27:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:49,742 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:49,742 INFO L421 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-11 15:27:49,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 15:27:49,742 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-11 15:27:49,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:49,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019498, now seen corresponding path program 12 times [2020-10-11 15:27:49,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:49,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397256712] [2020-10-11 15:27:49,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:50,375 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-11 15:27:50,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397256712] [2020-10-11 15:27:50,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:50,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:50,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764110142] [2020-10-11 15:27:50,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:50,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:50,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:50,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:50,377 INFO L87 Difference]: Start difference. First operand 132 states and 212 transitions. Second operand 12 states. [2020-10-11 15:27:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:51,152 INFO L93 Difference]: Finished difference Result 153 states and 241 transitions. [2020-10-11 15:27:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 15:27:51,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:51,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:51,153 INFO L225 Difference]: With dead ends: 153 [2020-10-11 15:27:51,154 INFO L226 Difference]: Without dead ends: 153 [2020-10-11 15:27:51,154 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-11 15:27:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2020-10-11 15:27:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-11 15:27:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 241 transitions. [2020-10-11 15:27:51,158 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 241 transitions. Word has length 22 [2020-10-11 15:27:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:51,158 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 241 transitions. [2020-10-11 15:27:51,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 241 transitions. [2020-10-11 15:27:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:51,159 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:51,159 INFO L421 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-11 15:27:51,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 15:27:51,159 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-11 15:27:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019508, now seen corresponding path program 4 times [2020-10-11 15:27:51,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:51,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23532677] [2020-10-11 15:27:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:51,328 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-11 15:27:51,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23532677] [2020-10-11 15:27:51,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:51,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 15:27:51,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388072446] [2020-10-11 15:27:51,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:27:51,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:51,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:27:51,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:27:51,331 INFO L87 Difference]: Start difference. First operand 152 states and 241 transitions. Second operand 8 states. [2020-10-11 15:27:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:51,539 INFO L93 Difference]: Finished difference Result 161 states and 251 transitions. [2020-10-11 15:27:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:27:51,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-11 15:27:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:51,540 INFO L225 Difference]: With dead ends: 161 [2020-10-11 15:27:51,540 INFO L226 Difference]: Without dead ends: 131 [2020-10-11 15:27:51,541 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-11 15:27:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2020-10-11 15:27:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-11 15:27:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2020-10-11 15:27:51,545 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 22 [2020-10-11 15:27:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:51,545 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-11 15:27:51,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:27:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2020-10-11 15:27:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:51,546 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:51,546 INFO L421 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-11 15:27:51,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 15:27:51,546 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-11 15:27:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323498, now seen corresponding path program 13 times [2020-10-11 15:27:51,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:51,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250579579] [2020-10-11 15:27:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:52,097 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-11 15:27:52,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250579579] [2020-10-11 15:27:52,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:52,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:52,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253638352] [2020-10-11 15:27:52,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:52,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:52,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:52,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:52,099 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand 12 states. [2020-10-11 15:27:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:52,850 INFO L93 Difference]: Finished difference Result 130 states and 200 transitions. [2020-10-11 15:27:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:27:52,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:52,852 INFO L225 Difference]: With dead ends: 130 [2020-10-11 15:27:52,852 INFO L226 Difference]: Without dead ends: 110 [2020-10-11 15:27:52,853 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-11 15:27:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-11 15:27:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-10-11 15:27:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-11 15:27:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2020-10-11 15:27:52,855 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 22 [2020-10-11 15:27:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:52,856 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2020-10-11 15:27:52,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-10-11 15:27:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:52,857 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:52,857 INFO L421 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-11 15:27:52,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-11 15:27:52,857 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-11 15:27:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash 280732566, now seen corresponding path program 14 times [2020-10-11 15:27:52,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:52,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850380469] [2020-10-11 15:27:52,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:53,358 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-11 15:27:53,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850380469] [2020-10-11 15:27:53,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:53,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:53,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120949025] [2020-10-11 15:27:53,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:53,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:53,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:53,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:53,359 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 12 states. [2020-10-11 15:27:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:54,032 INFO L93 Difference]: Finished difference Result 120 states and 178 transitions. [2020-10-11 15:27:54,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 15:27:54,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:54,033 INFO L225 Difference]: With dead ends: 120 [2020-10-11 15:27:54,033 INFO L226 Difference]: Without dead ends: 76 [2020-10-11 15:27:54,033 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-11 15:27:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2020-10-11 15:27:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-11 15:27:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2020-10-11 15:27:54,036 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 22 [2020-10-11 15:27:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:54,036 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2020-10-11 15:27:54,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2020-10-11 15:27:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:54,037 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:54,037 INFO L421 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-11 15:27:54,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-11 15:27:54,038 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-11 15:27:54,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash 779226054, now seen corresponding path program 15 times [2020-10-11 15:27:54,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:54,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772924403] [2020-10-11 15:27:54,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:54,676 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-11 15:27:54,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772924403] [2020-10-11 15:27:54,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:54,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:54,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880274083] [2020-10-11 15:27:54,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:54,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:54,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:54,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:54,678 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 12 states. [2020-10-11 15:27:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:55,283 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-10-11 15:27:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 15:27:55,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:27:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:55,284 INFO L225 Difference]: With dead ends: 66 [2020-10-11 15:27:55,284 INFO L226 Difference]: Without dead ends: 0 [2020-10-11 15:27:55,285 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-11 15:27:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-11 15:27:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-11 15:27:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-11 15:27:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-11 15:27:55,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-11 15:27:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:55,286 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-11 15:27:55,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-11 15:27:55,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-11 15:27:55,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-11 15:27:55,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:27:55 BasicIcfg [2020-10-11 15:27:55,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:27:55,291 INFO L168 Benchmark]: Toolchain (without parser) took 85765.27 ms. Allocated memory was 252.7 MB in the beginning and 611.3 MB in the end (delta: 358.6 MB). Free memory was 205.5 MB in the beginning and 353.7 MB in the end (delta: -148.2 MB). Peak memory consumption was 210.4 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:55,292 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:27:55,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1520.94 ms. Allocated memory was 252.7 MB in the beginning and 357.0 MB in the end (delta: 104.3 MB). Free memory was 205.5 MB in the beginning and 320.1 MB in the end (delta: -114.6 MB). Peak memory consumption was 109.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:55,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.96 ms. Allocated memory is still 357.0 MB. Free memory was 320.1 MB in the beginning and 316.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:55,293 INFO L168 Benchmark]: Boogie Preprocessor took 45.88 ms. Allocated memory is still 357.0 MB. Free memory was 316.8 MB in the beginning and 313.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:55,293 INFO L168 Benchmark]: RCFGBuilder took 708.84 ms. Allocated memory is still 357.0 MB. Free memory was 313.5 MB in the beginning and 264.3 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:55,293 INFO L168 Benchmark]: TraceAbstraction took 83367.55 ms. Allocated memory was 357.0 MB in the beginning and 611.3 MB in the end (delta: 254.3 MB). Free memory was 264.3 MB in the beginning and 353.7 MB in the end (delta: -89.4 MB). Peak memory consumption was 164.8 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:55,296 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.24 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1520.94 ms. Allocated memory was 252.7 MB in the beginning and 357.0 MB in the end (delta: 104.3 MB). Free memory was 205.5 MB in the beginning and 320.1 MB in the end (delta: -114.6 MB). Peak memory consumption was 109.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 115.96 ms. Allocated memory is still 357.0 MB. Free memory was 320.1 MB in the beginning and 316.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.88 ms. Allocated memory is still 357.0 MB. Free memory was 316.8 MB in the beginning and 313.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. * RCFGBuilder took 708.84 ms. Allocated memory is still 357.0 MB. Free memory was 313.5 MB in the beginning and 264.3 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 83367.55 ms. Allocated memory was 357.0 MB in the beginning and 611.3 MB in the end (delta: 254.3 MB). Free memory was 264.3 MB in the beginning and 353.7 MB in the end (delta: -89.4 MB). Peak memory consumption was 164.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1759 VarBasedMoverChecksPositive, 69 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 24 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 52.0s, 140 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 59.5s, 150 PlacesBefore, 40 PlacesAfterwards, 154 TransitionsBefore, 38 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 7 FixpointIterations, 90 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 174 TotalNumberOfCompositions, 6338 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: 83.2s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 59.6s, HoareTripleCheckerStatistics: 626 SDtfs, 908 SDslu, 2076 SDs, 0 SdLazy, 4679 SolverSat, 441 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 22 SyntacticMatches, 33 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred 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, 26 MinimizatonAttempts, 446 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 198300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...