/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 13:16:59,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 13:16:59,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 13:16:59,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 13:16:59,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 13:16:59,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 13:16:59,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 13:16:59,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 13:16:59,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 13:16:59,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 13:16:59,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 13:16:59,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 13:16:59,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 13:16:59,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 13:16:59,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 13:16:59,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 13:16:59,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 13:16:59,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 13:16:59,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 13:16:59,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 13:16:59,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 13:16:59,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 13:16:59,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 13:16:59,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 13:16:59,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 13:16:59,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 13:16:59,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 13:16:59,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 13:16:59,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 13:16:59,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 13:16:59,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 13:16:59,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 13:16:59,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 13:16:59,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 13:16:59,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 13:16:59,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 13:16:59,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 13:16:59,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 13:16:59,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 13:16:59,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 13:16:59,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 13:16:59,300 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-09 13:16:59,342 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 13:16:59,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 13:16:59,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 13:16:59,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 13:16:59,344 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 13:16:59,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 13:16:59,344 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 13:16:59,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 13:16:59,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 13:16:59,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 13:16:59,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 13:16:59,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 13:16:59,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 13:16:59,347 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 13:16:59,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 13:16:59,347 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 13:16:59,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 13:16:59,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 13:16:59,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 13:16:59,348 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 13:16:59,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 13:16:59,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 13:16:59,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 13:16:59,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 13:16:59,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 13:16:59,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 13:16:59,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 13:16:59,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 13:16:59,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 13:16:59,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 13:16:59,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 13:16:59,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 13:16:59,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 13:16:59,625 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 13:16:59,625 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 13:16:59,626 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-09 13:16:59,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e58cad5/7c88410166744c8ea1ebb75ecf6807bc/FLAG385937268 [2020-10-09 13:17:00,203 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 13:17:00,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-09 13:17:00,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e58cad5/7c88410166744c8ea1ebb75ecf6807bc/FLAG385937268 [2020-10-09 13:17:00,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e58cad5/7c88410166744c8ea1ebb75ecf6807bc [2020-10-09 13:17:00,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 13:17:00,509 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 13:17:00,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 13:17:00,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 13:17:00,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 13:17:00,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:17:00" (1/1) ... [2020-10-09 13:17:00,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e313fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:00, skipping insertion in model container [2020-10-09 13:17:00,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:17:00" (1/1) ... [2020-10-09 13:17:00,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 13:17:00,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 13:17:01,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:17:01,336 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 13:17:01,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:17:01,822 INFO L208 MainTranslator]: Completed translation [2020-10-09 13:17:01,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01 WrapperNode [2020-10-09 13:17:01,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 13:17:01,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 13:17:01,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 13:17:01,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 13:17:01,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (1/1) ... [2020-10-09 13:17:01,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (1/1) ... [2020-10-09 13:17:01,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 13:17:01,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 13:17:01,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 13:17:01,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 13:17:01,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (1/1) ... [2020-10-09 13:17:01,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (1/1) ... [2020-10-09 13:17:01,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (1/1) ... [2020-10-09 13:17:01,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (1/1) ... [2020-10-09 13:17:02,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (1/1) ... [2020-10-09 13:17:02,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (1/1) ... [2020-10-09 13:17:02,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (1/1) ... [2020-10-09 13:17:02,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 13:17:02,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 13:17:02,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 13:17:02,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 13:17:02,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (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-09 13:17:02,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 13:17:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 13:17:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-09 13:17:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-09 13:17:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 13:17:02,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 13:17:02,148 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-09 13:17:02,149 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-09 13:17:02,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 13:17:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 13:17:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-09 13:17:02,152 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 13:17:02,807 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 13:17:02,807 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-09 13:17:02,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:17:02 BoogieIcfgContainer [2020-10-09 13:17:02,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 13:17:02,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 13:17:02,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 13:17:02,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 13:17:02,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 01:17:00" (1/3) ... [2020-10-09 13:17:02,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a512282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:17:02, skipping insertion in model container [2020-10-09 13:17:02,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:01" (2/3) ... [2020-10-09 13:17:02,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a512282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:17:02, skipping insertion in model container [2020-10-09 13:17:02,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:17:02" (3/3) ... [2020-10-09 13:17:02,818 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2020-10-09 13:17:02,830 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 13:17:02,831 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 13:17:02,839 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-09 13:17:02,840 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 13:17:02,872 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,872 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,873 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,873 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,873 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,873 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,876 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,876 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,876 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,876 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,876 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,877 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,878 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,878 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,879 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,879 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,880 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,880 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,884 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,884 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,885 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,885 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,885 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,885 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,885 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,886 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,886 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,886 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,886 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,887 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,887 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,890 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,891 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,891 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,891 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,891 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,891 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,892 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,892 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,892 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,892 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,892 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,893 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,899 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,900 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,900 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,900 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,900 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,900 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,901 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,901 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,901 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,901 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,901 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,901 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:02,930 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-09 13:17:02,950 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 13:17:02,950 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 13:17:02,950 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 13:17:02,950 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 13:17:02,950 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 13:17:02,950 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 13:17:02,951 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 13:17:02,951 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 13:17:02,966 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 13:17:02,968 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 155 transitions, 332 flow [2020-10-09 13:17:02,971 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 155 transitions, 332 flow [2020-10-09 13:17:02,973 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions, 332 flow [2020-10-09 13:17:03,043 INFO L129 PetriNetUnfolder]: 11/193 cut-off events. [2020-10-09 13:17:03,044 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-09 13:17:03,050 INFO L80 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-09 13:17:03,055 INFO L117 LiptonReduction]: Number of co-enabled transitions 2884 [2020-10-09 13:17:03,215 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-09 13:17:03,252 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:03,258 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-09 13:17:03,282 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:03,284 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-09 13:17:03,284 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:17:03,305 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-09 13:17:03,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:03,339 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-09 13:17:03,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:03,363 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-09 13:17:03,364 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:17:05,441 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-09 13:17:05,475 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:05,480 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-09 13:17:05,499 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:05,501 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-09 13:17:05,501 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-09 13:17:05,515 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-09 13:17:05,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:05,551 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-09 13:17:05,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:05,574 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-09 13:17:05,575 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:07,875 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-09 13:17:07,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:07,904 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-09 13:17:07,924 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:07,927 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-09 13:17:07,927 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-09 13:17:07,945 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-09 13:17:07,974 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:08,023 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-09 13:17:08,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:08,048 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-09 13:17:08,048 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:10,144 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-09 13:17:10,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:10,174 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-09 13:17:10,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:10,195 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-09 13:17:10,195 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:17:10,222 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-09 13:17:10,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:10,251 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-09 13:17:10,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:10,271 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-09 13:17:10,271 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:17:12,322 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:12,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,351 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-09 13:17:12,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,376 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-09 13:17:12,377 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-09 13:17:12,390 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-09 13:17:12,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,436 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:12,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,464 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-09 13:17:12,465 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-09 13:17:12,819 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-09 13:17:12,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,848 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-09 13:17:12,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,866 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-09 13:17:12,866 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:12,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-09 13:17:12,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,913 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-09 13:17:12,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,935 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-09 13:17:12,935 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-09 13:17:15,407 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-09 13:17:15,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:15,435 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-09 13:17:15,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:15,456 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-09 13:17:15,456 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-09 13:17:15,474 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-09 13:17:15,496 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:15,501 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-09 13:17:15,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:15,521 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-09 13:17:15,522 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-09 13:17:17,540 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-09 13:17:17,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:17,572 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-09 13:17:17,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:17,598 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-09 13:17:17,599 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:17,613 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-09 13:17:17,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:17,637 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-09 13:17:17,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:17,658 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:17,658 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-09 13:17:19,705 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-09 13:17:19,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:19,731 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-09 13:17:19,755 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:19,756 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-09 13:17:19,757 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-09 13:17:19,766 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:19,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:19,787 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-09 13:17:19,805 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:19,805 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-09 13:17:19,806 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:22,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-09 13:17:22,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:22,077 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-09 13:17:22,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:22,101 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-09 13:17:22,102 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-09 13:17:22,117 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-09 13:17:22,138 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:22,143 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-09 13:17:22,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:22,175 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:22,176 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-09 13:17:24,396 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-09 13:17:24,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:24,432 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-09 13:17:24,456 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:24,457 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-09 13:17:24,458 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-09 13:17:24,468 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-09 13:17:24,499 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:24,504 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-09 13:17:24,529 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:24,530 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-09 13:17:24,530 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-09 13:17:26,690 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-09 13:17:26,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:26,717 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-09 13:17:26,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:26,738 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-09 13:17:26,738 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:26,755 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-09 13:17:26,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:26,785 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-09 13:17:26,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:26,809 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-09 13:17:26,809 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:29,077 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-09 13:17:29,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:29,104 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-09 13:17:29,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:29,125 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-09 13:17:29,126 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-09 13:17:29,141 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-09 13:17:29,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:29,174 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-09 13:17:29,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:29,190 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-09 13:17:29,191 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-09 13:17:31,249 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-09 13:17:31,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,281 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:31,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,310 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-09 13:17:31,310 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:31,320 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-09 13:17:31,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,350 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-09 13:17:31,370 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,371 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-09 13:17:31,371 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:33,382 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-09 13:17:33,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:33,407 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-09 13:17:33,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:33,433 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-09 13:17:33,433 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:33,449 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-09 13:17:33,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:33,476 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-09 13:17:33,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:33,495 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-09 13:17:33,495 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:35,604 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-09 13:17:35,644 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:35,648 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-09 13:17:35,673 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:35,673 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-09 13:17:35,674 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:35,685 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-09 13:17:35,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:35,733 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-09 13:17:35,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:35,765 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-09 13:17:35,765 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:38,123 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-09 13:17:38,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:38,154 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-09 13:17:38,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:38,171 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-09 13:17:38,172 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-09 13:17:38,182 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-09 13:17:38,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:38,209 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-09 13:17:38,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:38,228 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-09 13:17:38,228 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:40,304 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-09 13:17:40,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:40,328 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-09 13:17:40,347 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:40,348 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-09 13:17:40,349 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:40,367 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-09 13:17:40,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:40,400 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-09 13:17:40,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:40,423 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-09 13:17:40,423 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:42,485 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-09 13:17:42,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:42,507 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-09 13:17:42,527 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:42,528 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-09 13:17:42,529 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-09 13:17:42,597 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-09 13:17:42,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:42,624 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-09 13:17:42,642 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:42,642 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-09 13:17:42,643 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-09 13:17:42,653 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-09 13:17:42,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:42,686 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-09 13:17:42,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:42,706 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-09 13:17:42,707 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-09 13:17:44,938 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-09 13:17:44,968 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:44,972 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-09 13:17:44,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:44,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-09 13:17:44,992 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-09 13:17:45,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-09 13:17:45,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:45,036 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-09 13:17:45,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:45,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-09 13:17:45,060 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-09 13:17:47,096 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-09 13:17:47,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:47,120 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-09 13:17:47,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:47,137 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:47,137 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-09 13:17:47,145 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-09 13:17:47,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:47,170 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-09 13:17:47,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:47,189 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-09 13:17:47,189 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-09 13:17:49,358 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-09 13:17:49,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:49,386 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-09 13:17:49,406 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:49,407 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-09 13:17:49,408 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-09 13:17:49,419 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-09 13:17:49,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:49,448 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-09 13:17:49,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:49,470 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-09 13:17:49,470 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-09 13:17:52,247 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-09 13:17:52,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:52,276 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-09 13:17:52,295 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:52,296 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-09 13:17:52,297 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:17:52,312 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-09 13:17:52,350 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:52,354 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-09 13:17:52,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:52,384 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-09 13:17:52,384 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:17:55,191 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2020-10-09 13:17:55,342 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-09 13:17:56,030 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2020-10-09 13:17:56,041 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-09 13:17:56,267 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-10-09 13:17:56,268 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:56,285 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-09 13:17:56,596 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-09 13:17:56,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:56,599 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-09 13:17:56,599 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:250, output treesize:222 [2020-10-09 13:17:56,905 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-09 13:17:57,825 WARN L193 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2020-10-09 13:17:57,847 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-09 13:17:58,541 WARN L193 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-09 13:17:58,542 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:58,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-09 13:17:59,117 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-09 13:17:59,117 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:59,118 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-09 13:17:59,119 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-09 13:17:59,653 WARN L193 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-09 13:17:59,878 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-09 13:18:00,089 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-09 13:18:00,102 INFO L132 LiptonReduction]: Checked pairs total: 6656 [2020-10-09 13:18:00,102 INFO L134 LiptonReduction]: Total number of compositions: 167 [2020-10-09 13:18:00,109 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-10-09 13:18:00,142 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-10-09 13:18:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-10-09 13:18:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-09 13:18:00,150 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:00,151 INFO L421 BasicCegarLoop]: trace histogram [1] [2020-10-09 13:18:00,152 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-09 13:18:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash 557, now seen corresponding path program 1 times [2020-10-09 13:18:00,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:00,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785941740] [2020-10-09 13:18:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:00,420 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-09 13:18:00,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785941740] [2020-10-09 13:18:00,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:00,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-09 13:18:00,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231588920] [2020-10-09 13:18:00,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-09 13:18:00,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:00,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-09 13:18:00,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-09 13:18:00,449 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-10-09 13:18:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:00,486 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-10-09 13:18:00,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-09 13:18:00,488 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-09 13:18:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:00,516 INFO L225 Difference]: With dead ends: 423 [2020-10-09 13:18:00,517 INFO L226 Difference]: Without dead ends: 385 [2020-10-09 13:18:00,518 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-09 13:18:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-09 13:18:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-10-09 13:18:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-09 13:18:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-10-09 13:18:00,610 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-10-09 13:18:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:00,610 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-10-09 13:18:00,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-09 13:18:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-10-09 13:18:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-09 13:18:00,611 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:00,611 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-09 13:18:00,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 13:18:00,611 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-09 13:18:00,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash 17154767, now seen corresponding path program 1 times [2020-10-09 13:18:00,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:00,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341788999] [2020-10-09 13:18:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:00,900 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-09 13:18:00,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341788999] [2020-10-09 13:18:00,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:00,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 13:18:00,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122683237] [2020-10-09 13:18:00,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:18:00,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:00,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:18:00,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:18:00,903 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-10-09 13:18:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:01,062 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-10-09 13:18:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:18:01,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-09 13:18:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:01,069 INFO L225 Difference]: With dead ends: 540 [2020-10-09 13:18:01,070 INFO L226 Difference]: Without dead ends: 540 [2020-10-09 13:18:01,070 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-09 13:18:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-10-09 13:18:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-10-09 13:18:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-09 13:18:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-10-09 13:18:01,107 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-10-09 13:18:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:01,107 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-10-09 13:18:01,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:18:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-10-09 13:18:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-09 13:18:01,108 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:01,109 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-09 13:18:01,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 13:18:01,109 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-09 13:18:01,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash -694138238, now seen corresponding path program 1 times [2020-10-09 13:18:01,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:01,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46237540] [2020-10-09 13:18:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:01,185 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-09 13:18:01,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46237540] [2020-10-09 13:18:01,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:01,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:18:01,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881237041] [2020-10-09 13:18:01,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 13:18:01,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:01,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 13:18:01,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 13:18:01,187 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2020-10-09 13:18:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:01,323 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2020-10-09 13:18:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 13:18:01,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-10-09 13:18:01,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:01,328 INFO L225 Difference]: With dead ends: 599 [2020-10-09 13:18:01,329 INFO L226 Difference]: Without dead ends: 514 [2020-10-09 13:18:01,329 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 13:18:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-09 13:18:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-10-09 13:18:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-09 13:18:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-10-09 13:18:01,347 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-10-09 13:18:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:01,347 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-10-09 13:18:01,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 13:18:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-10-09 13:18:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-09 13:18:01,350 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:01,350 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:01,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 13:18:01,350 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-09 13:18:01,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1786983460, now seen corresponding path program 1 times [2020-10-09 13:18:01,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:01,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079430970] [2020-10-09 13:18:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:01,417 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-09 13:18:01,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079430970] [2020-10-09 13:18:01,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:01,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:18:01,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57541534] [2020-10-09 13:18:01,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:18:01,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:01,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:18:01,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:18:01,419 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-10-09 13:18:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:01,435 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-09 13:18:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:18:01,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-09 13:18:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:01,437 INFO L225 Difference]: With dead ends: 162 [2020-10-09 13:18:01,437 INFO L226 Difference]: Without dead ends: 162 [2020-10-09 13:18:01,438 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-09 13:18:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-09 13:18:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-09 13:18:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-09 13:18:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-09 13:18:01,442 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-09 13:18:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:01,443 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-09 13:18:01,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:18:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-09 13:18:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:01,445 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:01,445 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-09 13:18:01,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 13:18:01,446 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-09 13:18:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:01,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1425167552, now seen corresponding path program 1 times [2020-10-09 13:18:01,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:01,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81980916] [2020-10-09 13:18:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:01,862 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-09 13:18:01,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81980916] [2020-10-09 13:18:01,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:01,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 13:18:01,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898717412] [2020-10-09 13:18:01,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 13:18:01,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:01,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 13:18:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-09 13:18:01,867 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 12 states. [2020-10-09 13:18:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:02,893 INFO L93 Difference]: Finished difference Result 424 states and 841 transitions. [2020-10-09 13:18:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 13:18:02,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-09 13:18:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:02,896 INFO L225 Difference]: With dead ends: 424 [2020-10-09 13:18:02,897 INFO L226 Difference]: Without dead ends: 424 [2020-10-09 13:18:02,897 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-10-09 13:18:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-09 13:18:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 264. [2020-10-09 13:18:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-10-09 13:18:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 563 transitions. [2020-10-09 13:18:02,911 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 563 transitions. Word has length 22 [2020-10-09 13:18:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:02,912 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 563 transitions. [2020-10-09 13:18:02,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 13:18:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 563 transitions. [2020-10-09 13:18:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:02,919 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:02,919 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-09 13:18:02,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 13:18:02,920 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-09 13:18:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:02,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1425167535, now seen corresponding path program 1 times [2020-10-09 13:18:02,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:02,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514967098] [2020-10-09 13:18:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:03,160 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-09 13:18:03,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514967098] [2020-10-09 13:18:03,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:03,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 13:18:03,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691781242] [2020-10-09 13:18:03,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 13:18:03,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:03,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 13:18:03,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 13:18:03,163 INFO L87 Difference]: Start difference. First operand 264 states and 563 transitions. Second operand 6 states. [2020-10-09 13:18:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:03,266 INFO L93 Difference]: Finished difference Result 158 states and 264 transitions. [2020-10-09 13:18:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 13:18:03,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-09 13:18:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:03,268 INFO L225 Difference]: With dead ends: 158 [2020-10-09 13:18:03,268 INFO L226 Difference]: Without dead ends: 158 [2020-10-09 13:18:03,269 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-09 13:18:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-09 13:18:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-10-09 13:18:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-09 13:18:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 264 transitions. [2020-10-09 13:18:03,273 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 264 transitions. Word has length 22 [2020-10-09 13:18:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:03,273 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 264 transitions. [2020-10-09 13:18:03,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 13:18:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 264 transitions. [2020-10-09 13:18:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:03,275 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:03,275 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-09 13:18:03,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 13:18:03,275 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-09 13:18:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash 864306409, now seen corresponding path program 1 times [2020-10-09 13:18:03,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:03,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213115155] [2020-10-09 13:18:03,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:03,506 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-09 13:18:03,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213115155] [2020-10-09 13:18:03,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:03,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 13:18:03,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646799033] [2020-10-09 13:18:03,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 13:18:03,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 13:18:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-09 13:18:03,509 INFO L87 Difference]: Start difference. First operand 158 states and 264 transitions. Second operand 8 states. [2020-10-09 13:18:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:03,881 INFO L93 Difference]: Finished difference Result 164 states and 264 transitions. [2020-10-09 13:18:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 13:18:03,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-09 13:18:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:03,883 INFO L225 Difference]: With dead ends: 164 [2020-10-09 13:18:03,883 INFO L226 Difference]: Without dead ends: 164 [2020-10-09 13:18:03,883 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-09 13:18:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-10-09 13:18:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2020-10-09 13:18:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-09 13:18:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 240 transitions. [2020-10-09 13:18:03,890 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 240 transitions. Word has length 22 [2020-10-09 13:18:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:03,890 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 240 transitions. [2020-10-09 13:18:03,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 13:18:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 240 transitions. [2020-10-09 13:18:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:03,891 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:03,891 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-09 13:18:03,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 13:18:03,892 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-09 13:18:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:03,892 INFO L82 PathProgramCache]: Analyzing trace with hash -412491025, now seen corresponding path program 2 times [2020-10-09 13:18:03,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:03,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92291272] [2020-10-09 13:18:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:04,549 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-09 13:18:04,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92291272] [2020-10-09 13:18:04,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:04,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:04,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579428317] [2020-10-09 13:18:04,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:04,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:04,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:04,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:04,551 INFO L87 Difference]: Start difference. First operand 150 states and 240 transitions. Second operand 14 states. [2020-10-09 13:18:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:05,480 INFO L93 Difference]: Finished difference Result 179 states and 267 transitions. [2020-10-09 13:18:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:18:05,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:05,482 INFO L225 Difference]: With dead ends: 179 [2020-10-09 13:18:05,482 INFO L226 Difference]: Without dead ends: 165 [2020-10-09 13:18:05,482 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-09 13:18:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2020-10-09 13:18:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-09 13:18:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2020-10-09 13:18:05,487 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 22 [2020-10-09 13:18:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:05,487 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2020-10-09 13:18:05,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2020-10-09 13:18:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:05,488 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:05,488 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-09 13:18:05,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 13:18:05,488 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-09 13:18:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash -524474255, now seen corresponding path program 3 times [2020-10-09 13:18:05,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:05,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406083867] [2020-10-09 13:18:05,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:06,107 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-09 13:18:06,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406083867] [2020-10-09 13:18:06,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:06,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:06,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262739049] [2020-10-09 13:18:06,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:06,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:06,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:06,110 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 14 states. [2020-10-09 13:18:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:07,082 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2020-10-09 13:18:07,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-09 13:18:07,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:07,085 INFO L225 Difference]: With dead ends: 176 [2020-10-09 13:18:07,085 INFO L226 Difference]: Without dead ends: 163 [2020-10-09 13:18:07,086 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-10-09 13:18:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-09 13:18:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-10-09 13:18:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-09 13:18:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 251 transitions. [2020-10-09 13:18:07,090 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 251 transitions. Word has length 22 [2020-10-09 13:18:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:07,090 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 251 transitions. [2020-10-09 13:18:07,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 251 transitions. [2020-10-09 13:18:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:07,091 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:07,091 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-09 13:18:07,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 13:18:07,092 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-09 13:18:07,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:07,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1681973083, now seen corresponding path program 2 times [2020-10-09 13:18:07,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:07,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652629657] [2020-10-09 13:18:07,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:07,310 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-09 13:18:07,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652629657] [2020-10-09 13:18:07,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:07,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 13:18:07,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673028500] [2020-10-09 13:18:07,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-09 13:18:07,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:07,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-09 13:18:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-09 13:18:07,312 INFO L87 Difference]: Start difference. First operand 163 states and 251 transitions. Second operand 11 states. [2020-10-09 13:18:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:07,869 INFO L93 Difference]: Finished difference Result 223 states and 354 transitions. [2020-10-09 13:18:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:07,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-09 13:18:07,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:07,871 INFO L225 Difference]: With dead ends: 223 [2020-10-09 13:18:07,872 INFO L226 Difference]: Without dead ends: 223 [2020-10-09 13:18:07,872 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2020-10-09 13:18:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-10-09 13:18:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 174. [2020-10-09 13:18:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-09 13:18:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 274 transitions. [2020-10-09 13:18:07,878 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 274 transitions. Word has length 22 [2020-10-09 13:18:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:07,878 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 274 transitions. [2020-10-09 13:18:07,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-09 13:18:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 274 transitions. [2020-10-09 13:18:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:07,879 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:07,879 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-09 13:18:07,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 13:18:07,880 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-09 13:18:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash 671772819, now seen corresponding path program 4 times [2020-10-09 13:18:07,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:07,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515623339] [2020-10-09 13:18:07,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:08,546 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-09 13:18:08,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515623339] [2020-10-09 13:18:08,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:08,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:08,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464958665] [2020-10-09 13:18:08,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:08,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:08,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:08,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:08,548 INFO L87 Difference]: Start difference. First operand 174 states and 274 transitions. Second operand 14 states. [2020-10-09 13:18:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:09,512 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2020-10-09 13:18:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:18:09,513 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:09,515 INFO L225 Difference]: With dead ends: 188 [2020-10-09 13:18:09,515 INFO L226 Difference]: Without dead ends: 180 [2020-10-09 13:18:09,516 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-09 13:18:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2020-10-09 13:18:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-09 13:18:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 273 transitions. [2020-10-09 13:18:09,521 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 273 transitions. Word has length 22 [2020-10-09 13:18:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:09,521 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 273 transitions. [2020-10-09 13:18:09,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 273 transitions. [2020-10-09 13:18:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:09,523 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:09,523 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-09 13:18:09,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 13:18:09,523 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-09 13:18:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash -481747075, now seen corresponding path program 5 times [2020-10-09 13:18:09,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:09,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939187528] [2020-10-09 13:18:09,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:10,148 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-09 13:18:10,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939187528] [2020-10-09 13:18:10,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:10,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:10,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041156301] [2020-10-09 13:18:10,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:10,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:10,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:10,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:10,150 INFO L87 Difference]: Start difference. First operand 174 states and 273 transitions. Second operand 14 states. [2020-10-09 13:18:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:11,023 INFO L93 Difference]: Finished difference Result 187 states and 285 transitions. [2020-10-09 13:18:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:11,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:11,025 INFO L225 Difference]: With dead ends: 187 [2020-10-09 13:18:11,025 INFO L226 Difference]: Without dead ends: 174 [2020-10-09 13:18:11,026 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-09 13:18:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2020-10-09 13:18:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-09 13:18:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 264 transitions. [2020-10-09 13:18:11,032 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 264 transitions. Word has length 22 [2020-10-09 13:18:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:11,033 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 264 transitions. [2020-10-09 13:18:11,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 264 transitions. [2020-10-09 13:18:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:11,035 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:11,035 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-09 13:18:11,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-09 13:18:11,036 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-09 13:18:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash 186432761, now seen corresponding path program 6 times [2020-10-09 13:18:11,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:11,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653895103] [2020-10-09 13:18:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:11,735 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-09 13:18:11,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653895103] [2020-10-09 13:18:11,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:11,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:11,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536117968] [2020-10-09 13:18:11,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:11,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:11,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:11,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:11,738 INFO L87 Difference]: Start difference. First operand 170 states and 264 transitions. Second operand 14 states. [2020-10-09 13:18:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:12,700 INFO L93 Difference]: Finished difference Result 180 states and 273 transitions. [2020-10-09 13:18:12,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:12,701 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:12,703 INFO L225 Difference]: With dead ends: 180 [2020-10-09 13:18:12,703 INFO L226 Difference]: Without dead ends: 166 [2020-10-09 13:18:12,703 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-10-09 13:18:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2020-10-09 13:18:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-10-09 13:18:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 256 transitions. [2020-10-09 13:18:12,707 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 256 transitions. Word has length 22 [2020-10-09 13:18:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:12,709 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 256 transitions. [2020-10-09 13:18:12,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 256 transitions. [2020-10-09 13:18:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:12,710 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:12,710 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-09 13:18:12,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-09 13:18:12,711 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-09 13:18:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1728779239, now seen corresponding path program 7 times [2020-10-09 13:18:12,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:12,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931025495] [2020-10-09 13:18:12,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:13,313 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-09 13:18:13,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931025495] [2020-10-09 13:18:13,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:13,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:13,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072068502] [2020-10-09 13:18:13,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:13,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:13,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:13,315 INFO L87 Difference]: Start difference. First operand 166 states and 256 transitions. Second operand 14 states. [2020-10-09 13:18:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:14,251 INFO L93 Difference]: Finished difference Result 172 states and 261 transitions. [2020-10-09 13:18:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:18:14,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:14,253 INFO L225 Difference]: With dead ends: 172 [2020-10-09 13:18:14,253 INFO L226 Difference]: Without dead ends: 152 [2020-10-09 13:18:14,254 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-09 13:18:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-09 13:18:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-09 13:18:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-09 13:18:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2020-10-09 13:18:14,258 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 22 [2020-10-09 13:18:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:14,258 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2020-10-09 13:18:14,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2020-10-09 13:18:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:14,259 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:14,259 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-09 13:18:14,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-09 13:18:14,260 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-09 13:18:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:14,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1510347584, now seen corresponding path program 2 times [2020-10-09 13:18:14,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:14,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265805875] [2020-10-09 13:18:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:14,480 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-09 13:18:14,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265805875] [2020-10-09 13:18:14,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:14,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 13:18:14,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487501453] [2020-10-09 13:18:14,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 13:18:14,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:14,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 13:18:14,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-09 13:18:14,483 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand 9 states. [2020-10-09 13:18:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:14,851 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2020-10-09 13:18:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 13:18:14,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-09 13:18:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:14,852 INFO L225 Difference]: With dead ends: 188 [2020-10-09 13:18:14,852 INFO L226 Difference]: Without dead ends: 171 [2020-10-09 13:18:14,853 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-09 13:18:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2020-10-09 13:18:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-09 13:18:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 217 transitions. [2020-10-09 13:18:14,859 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 217 transitions. Word has length 22 [2020-10-09 13:18:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:14,860 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 217 transitions. [2020-10-09 13:18:14,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 13:18:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 217 transitions. [2020-10-09 13:18:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:14,860 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:14,861 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-09 13:18:14,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-09 13:18:14,861 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-09 13:18:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:14,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1730688272, now seen corresponding path program 3 times [2020-10-09 13:18:14,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:14,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962666419] [2020-10-09 13:18:14,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:15,094 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-09 13:18:15,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962666419] [2020-10-09 13:18:15,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:15,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 13:18:15,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126724545] [2020-10-09 13:18:15,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 13:18:15,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:15,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 13:18:15,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-09 13:18:15,096 INFO L87 Difference]: Start difference. First operand 135 states and 217 transitions. Second operand 9 states. [2020-10-09 13:18:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:15,579 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2020-10-09 13:18:15,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 13:18:15,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-09 13:18:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:15,581 INFO L225 Difference]: With dead ends: 171 [2020-10-09 13:18:15,582 INFO L226 Difference]: Without dead ends: 171 [2020-10-09 13:18:15,583 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-09 13:18:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2020-10-09 13:18:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-09 13:18:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 226 transitions. [2020-10-09 13:18:15,590 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 226 transitions. Word has length 22 [2020-10-09 13:18:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:15,590 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 226 transitions. [2020-10-09 13:18:15,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 13:18:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 226 transitions. [2020-10-09 13:18:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:15,591 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:15,592 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-09 13:18:15,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-09 13:18:15,592 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-09 13:18:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:15,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1730688289, now seen corresponding path program 8 times [2020-10-09 13:18:15,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:15,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303342558] [2020-10-09 13:18:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:16,387 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-09 13:18:16,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303342558] [2020-10-09 13:18:16,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:16,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:16,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590535826] [2020-10-09 13:18:16,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:16,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:16,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:16,390 INFO L87 Difference]: Start difference. First operand 140 states and 226 transitions. Second operand 14 states. [2020-10-09 13:18:17,061 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-10-09 13:18:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:17,456 INFO L93 Difference]: Finished difference Result 171 states and 271 transitions. [2020-10-09 13:18:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:17,457 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:17,458 INFO L225 Difference]: With dead ends: 171 [2020-10-09 13:18:17,458 INFO L226 Difference]: Without dead ends: 143 [2020-10-09 13:18:17,459 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-09 13:18:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2020-10-09 13:18:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-09 13:18:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 225 transitions. [2020-10-09 13:18:17,463 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 225 transitions. Word has length 22 [2020-10-09 13:18:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:17,463 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 225 transitions. [2020-10-09 13:18:17,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 225 transitions. [2020-10-09 13:18:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:17,464 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:17,464 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-09 13:18:17,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-09 13:18:17,464 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-09 13:18:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1523655162, now seen corresponding path program 4 times [2020-10-09 13:18:17,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:17,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498822739] [2020-10-09 13:18:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:17,665 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-09 13:18:17,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498822739] [2020-10-09 13:18:17,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:17,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 13:18:17,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963023082] [2020-10-09 13:18:17,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 13:18:17,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:17,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 13:18:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-09 13:18:17,667 INFO L87 Difference]: Start difference. First operand 140 states and 225 transitions. Second operand 9 states. [2020-10-09 13:18:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:18,059 INFO L93 Difference]: Finished difference Result 176 states and 276 transitions. [2020-10-09 13:18:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 13:18:18,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-09 13:18:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:18,061 INFO L225 Difference]: With dead ends: 176 [2020-10-09 13:18:18,061 INFO L226 Difference]: Without dead ends: 176 [2020-10-09 13:18:18,062 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-09 13:18:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2020-10-09 13:18:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-09 13:18:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2020-10-09 13:18:18,068 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 22 [2020-10-09 13:18:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:18,068 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2020-10-09 13:18:18,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 13:18:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2020-10-09 13:18:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:18,069 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:18,070 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-09 13:18:18,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-09 13:18:18,070 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-09 13:18:18,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1523655179, now seen corresponding path program 9 times [2020-10-09 13:18:18,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:18,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793737479] [2020-10-09 13:18:18,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:18,755 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-09 13:18:18,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793737479] [2020-10-09 13:18:18,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:18,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:18,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165285870] [2020-10-09 13:18:18,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:18,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:18,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:18,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:18,757 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand 14 states. [2020-10-09 13:18:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:19,802 INFO L93 Difference]: Finished difference Result 147 states and 237 transitions. [2020-10-09 13:18:19,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:19,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:19,804 INFO L225 Difference]: With dead ends: 147 [2020-10-09 13:18:19,804 INFO L226 Difference]: Without dead ends: 125 [2020-10-09 13:18:19,804 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-09 13:18:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2020-10-09 13:18:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-09 13:18:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 175 transitions. [2020-10-09 13:18:19,808 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 175 transitions. Word has length 22 [2020-10-09 13:18:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:19,808 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 175 transitions. [2020-10-09 13:18:19,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 175 transitions. [2020-10-09 13:18:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:19,809 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:19,809 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-09 13:18:19,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-09 13:18:19,809 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-09 13:18:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1986983371, now seen corresponding path program 10 times [2020-10-09 13:18:19,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:19,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593935419] [2020-10-09 13:18:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:20,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-09 13:18:20,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593935419] [2020-10-09 13:18:20,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:20,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:20,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863194338] [2020-10-09 13:18:20,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:20,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:20,449 INFO L87 Difference]: Start difference. First operand 109 states and 175 transitions. Second operand 14 states. [2020-10-09 13:18:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:21,558 INFO L93 Difference]: Finished difference Result 148 states and 232 transitions. [2020-10-09 13:18:21,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-09 13:18:21,558 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:21,559 INFO L225 Difference]: With dead ends: 148 [2020-10-09 13:18:21,560 INFO L226 Difference]: Without dead ends: 134 [2020-10-09 13:18:21,560 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-09 13:18:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-09 13:18:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2020-10-09 13:18:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-09 13:18:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 173 transitions. [2020-10-09 13:18:21,565 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 173 transitions. Word has length 22 [2020-10-09 13:18:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:21,565 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 173 transitions. [2020-10-09 13:18:21,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 173 transitions. [2020-10-09 13:18:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:21,566 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:21,566 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-09 13:18:21,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-09 13:18:21,566 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-09 13:18:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:21,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1039623051, now seen corresponding path program 11 times [2020-10-09 13:18:21,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:21,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192562234] [2020-10-09 13:18:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:22,229 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-09 13:18:22,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192562234] [2020-10-09 13:18:22,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:22,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:22,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560063165] [2020-10-09 13:18:22,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:22,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:22,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:22,235 INFO L87 Difference]: Start difference. First operand 109 states and 173 transitions. Second operand 14 states. [2020-10-09 13:18:22,719 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-10-09 13:18:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:23,183 INFO L93 Difference]: Finished difference Result 140 states and 216 transitions. [2020-10-09 13:18:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:18:23,185 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:23,185 INFO L225 Difference]: With dead ends: 140 [2020-10-09 13:18:23,185 INFO L226 Difference]: Without dead ends: 124 [2020-10-09 13:18:23,186 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-09 13:18:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2020-10-09 13:18:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-09 13:18:23,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 157 transitions. [2020-10-09 13:18:23,189 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 157 transitions. Word has length 22 [2020-10-09 13:18:23,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:23,189 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 157 transitions. [2020-10-09 13:18:23,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 157 transitions. [2020-10-09 13:18:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:23,190 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:23,190 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-09 13:18:23,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-09 13:18:23,190 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-09 13:18:23,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:23,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2100578423, now seen corresponding path program 12 times [2020-10-09 13:18:23,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:23,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086292793] [2020-10-09 13:18:23,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:23,883 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-09 13:18:23,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086292793] [2020-10-09 13:18:23,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:23,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:23,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630143558] [2020-10-09 13:18:23,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:23,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:23,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:23,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:23,885 INFO L87 Difference]: Start difference. First operand 99 states and 157 transitions. Second operand 14 states. [2020-10-09 13:18:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:24,946 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2020-10-09 13:18:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:24,946 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:24,947 INFO L225 Difference]: With dead ends: 138 [2020-10-09 13:18:24,947 INFO L226 Difference]: Without dead ends: 105 [2020-10-09 13:18:24,948 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-09 13:18:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2020-10-09 13:18:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-09 13:18:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2020-10-09 13:18:24,950 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 22 [2020-10-09 13:18:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:24,951 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2020-10-09 13:18:24,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2020-10-09 13:18:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:24,951 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:24,951 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-09 13:18:24,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-09 13:18:24,952 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-09 13:18:24,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:24,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1068559361, now seen corresponding path program 13 times [2020-10-09 13:18:24,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:24,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543530767] [2020-10-09 13:18:24,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:25,690 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-09 13:18:25,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543530767] [2020-10-09 13:18:25,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:25,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:25,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732255984] [2020-10-09 13:18:25,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:25,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:25,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:25,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:25,693 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand 14 states. [2020-10-09 13:18:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:26,676 INFO L93 Difference]: Finished difference Result 126 states and 193 transitions. [2020-10-09 13:18:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:26,677 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:26,678 INFO L225 Difference]: With dead ends: 126 [2020-10-09 13:18:26,678 INFO L226 Difference]: Without dead ends: 92 [2020-10-09 13:18:26,679 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-09 13:18:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2020-10-09 13:18:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-09 13:18:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2020-10-09 13:18:26,681 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 22 [2020-10-09 13:18:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:26,682 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2020-10-09 13:18:26,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2020-10-09 13:18:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:26,682 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:26,683 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-09 13:18:26,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-09 13:18:26,683 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-09 13:18:26,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:26,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1273870831, now seen corresponding path program 14 times [2020-10-09 13:18:26,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:26,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343820576] [2020-10-09 13:18:26,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:27,297 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-09 13:18:27,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343820576] [2020-10-09 13:18:27,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:27,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:27,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127938318] [2020-10-09 13:18:27,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:27,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:27,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:27,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:27,298 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand 14 states. [2020-10-09 13:18:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:28,165 INFO L93 Difference]: Finished difference Result 95 states and 143 transitions. [2020-10-09 13:18:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:28,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:28,167 INFO L225 Difference]: With dead ends: 95 [2020-10-09 13:18:28,167 INFO L226 Difference]: Without dead ends: 80 [2020-10-09 13:18:28,168 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-09 13:18:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-09 13:18:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-09 13:18:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2020-10-09 13:18:28,170 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 22 [2020-10-09 13:18:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:28,170 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2020-10-09 13:18:28,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2020-10-09 13:18:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:28,171 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:28,171 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-09 13:18:28,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-09 13:18:28,171 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-09 13:18:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash 341292095, now seen corresponding path program 15 times [2020-10-09 13:18:28,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:28,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603680392] [2020-10-09 13:18:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:28,938 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-09 13:18:28,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603680392] [2020-10-09 13:18:28,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:28,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:28,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657639580] [2020-10-09 13:18:28,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:28,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:28,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:28,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:28,941 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand 14 states. [2020-10-09 13:18:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:29,889 INFO L93 Difference]: Finished difference Result 110 states and 172 transitions. [2020-10-09 13:18:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:29,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:29,890 INFO L225 Difference]: With dead ends: 110 [2020-10-09 13:18:29,890 INFO L226 Difference]: Without dead ends: 77 [2020-10-09 13:18:29,890 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-09 13:18:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-09 13:18:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-09 13:18:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2020-10-09 13:18:29,893 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 124 transitions. Word has length 22 [2020-10-09 13:18:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:29,893 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 124 transitions. [2020-10-09 13:18:29,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 124 transitions. [2020-10-09 13:18:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:29,894 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:29,894 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-09 13:18:29,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-09 13:18:29,894 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-09 13:18:29,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:29,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2099874535, now seen corresponding path program 16 times [2020-10-09 13:18:29,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:29,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148190826] [2020-10-09 13:18:29,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:30,708 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-09 13:18:30,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148190826] [2020-10-09 13:18:30,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:30,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:30,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129776768] [2020-10-09 13:18:30,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:30,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:30,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:30,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:30,710 INFO L87 Difference]: Start difference. First operand 77 states and 124 transitions. Second operand 14 states. [2020-10-09 13:18:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:31,680 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2020-10-09 13:18:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:31,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:31,681 INFO L225 Difference]: With dead ends: 111 [2020-10-09 13:18:31,681 INFO L226 Difference]: Without dead ends: 80 [2020-10-09 13:18:31,682 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-09 13:18:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2020-10-09 13:18:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-09 13:18:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 127 transitions. [2020-10-09 13:18:31,685 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 127 transitions. Word has length 22 [2020-10-09 13:18:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:31,685 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 127 transitions. [2020-10-09 13:18:31,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 127 transitions. [2020-10-09 13:18:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:31,686 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:31,686 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-09 13:18:31,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-09 13:18:31,686 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1892841425, now seen corresponding path program 17 times [2020-10-09 13:18:31,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:31,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921859206] [2020-10-09 13:18:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:32,370 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-09 13:18:32,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921859206] [2020-10-09 13:18:32,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:32,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:32,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189397817] [2020-10-09 13:18:32,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:32,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:32,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:32,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:32,372 INFO L87 Difference]: Start difference. First operand 79 states and 127 transitions. Second operand 14 states. [2020-10-09 13:18:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:33,316 INFO L93 Difference]: Finished difference Result 128 states and 209 transitions. [2020-10-09 13:18:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:33,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:33,317 INFO L225 Difference]: With dead ends: 128 [2020-10-09 13:18:33,317 INFO L226 Difference]: Without dead ends: 103 [2020-10-09 13:18:33,317 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-09 13:18:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2020-10-09 13:18:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-09 13:18:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2020-10-09 13:18:33,321 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 22 [2020-10-09 13:18:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:33,321 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2020-10-09 13:18:33,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2020-10-09 13:18:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:33,322 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:33,322 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-09 13:18:33,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-09 13:18:33,322 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1938797679, now seen corresponding path program 18 times [2020-10-09 13:18:33,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:33,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675103889] [2020-10-09 13:18:33,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:33,911 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-09 13:18:33,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675103889] [2020-10-09 13:18:33,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:33,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:33,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573091654] [2020-10-09 13:18:33,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:33,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:33,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:33,913 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand 14 states. [2020-10-09 13:18:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:34,900 INFO L93 Difference]: Finished difference Result 134 states and 212 transitions. [2020-10-09 13:18:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-09 13:18:34,900 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:34,902 INFO L225 Difference]: With dead ends: 134 [2020-10-09 13:18:34,902 INFO L226 Difference]: Without dead ends: 117 [2020-10-09 13:18:34,903 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-09 13:18:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-09 13:18:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 91. [2020-10-09 13:18:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-09 13:18:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 147 transitions. [2020-10-09 13:18:34,906 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 147 transitions. Word has length 22 [2020-10-09 13:18:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:34,907 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 147 transitions. [2020-10-09 13:18:34,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 147 transitions. [2020-10-09 13:18:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:34,907 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:34,908 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-09 13:18:34,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-09 13:18:34,908 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:34,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1408809297, now seen corresponding path program 19 times [2020-10-09 13:18:34,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:34,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577210561] [2020-10-09 13:18:34,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:35,512 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-09 13:18:35,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577210561] [2020-10-09 13:18:35,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:35,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:35,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821134881] [2020-10-09 13:18:35,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:35,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:35,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:35,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:35,514 INFO L87 Difference]: Start difference. First operand 91 states and 147 transitions. Second operand 14 states. [2020-10-09 13:18:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:36,383 INFO L93 Difference]: Finished difference Result 126 states and 196 transitions. [2020-10-09 13:18:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:18:36,384 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:36,385 INFO L225 Difference]: With dead ends: 126 [2020-10-09 13:18:36,385 INFO L226 Difference]: Without dead ends: 107 [2020-10-09 13:18:36,386 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-09 13:18:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2020-10-09 13:18:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-09 13:18:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2020-10-09 13:18:36,388 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 22 [2020-10-09 13:18:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:36,388 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-10-09 13:18:36,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2020-10-09 13:18:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:36,389 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:36,389 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-09 13:18:36,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-09 13:18:36,390 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1825202627, now seen corresponding path program 20 times [2020-10-09 13:18:36,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:36,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512974591] [2020-10-09 13:18:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:37,105 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-09 13:18:37,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512974591] [2020-10-09 13:18:37,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:37,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:37,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87038873] [2020-10-09 13:18:37,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:37,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:37,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:37,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:37,106 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand 14 states. [2020-10-09 13:18:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:38,076 INFO L93 Difference]: Finished difference Result 123 states and 196 transitions. [2020-10-09 13:18:38,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:38,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:38,078 INFO L225 Difference]: With dead ends: 123 [2020-10-09 13:18:38,079 INFO L226 Difference]: Without dead ends: 87 [2020-10-09 13:18:38,079 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-09 13:18:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2020-10-09 13:18:38,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-09 13:18:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2020-10-09 13:18:38,081 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 22 [2020-10-09 13:18:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:38,081 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2020-10-09 13:18:38,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2020-10-09 13:18:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:38,082 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:38,082 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-09 13:18:38,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-09 13:18:38,082 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:38,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:38,083 INFO L82 PathProgramCache]: Analyzing trace with hash -699373115, now seen corresponding path program 21 times [2020-10-09 13:18:38,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:38,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999255315] [2020-10-09 13:18:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:38,830 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-09 13:18:38,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999255315] [2020-10-09 13:18:38,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:38,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:38,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646245462] [2020-10-09 13:18:38,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:38,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:38,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:38,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:38,832 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand 14 states. [2020-10-09 13:18:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:39,817 INFO L93 Difference]: Finished difference Result 108 states and 168 transitions. [2020-10-09 13:18:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:39,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:39,819 INFO L225 Difference]: With dead ends: 108 [2020-10-09 13:18:39,819 INFO L226 Difference]: Without dead ends: 62 [2020-10-09 13:18:39,819 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-09 13:18:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-09 13:18:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-09 13:18:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2020-10-09 13:18:39,821 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 22 [2020-10-09 13:18:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:39,821 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2020-10-09 13:18:39,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2020-10-09 13:18:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:39,822 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:39,822 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-09 13:18:39,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-09 13:18:39,822 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash -675636301, now seen corresponding path program 22 times [2020-10-09 13:18:39,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:39,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122559880] [2020-10-09 13:18:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:40,543 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-09 13:18:40,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122559880] [2020-10-09 13:18:40,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:40,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:40,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809048360] [2020-10-09 13:18:40,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:40,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:40,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:40,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:40,546 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand 14 states. [2020-10-09 13:18:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:41,537 INFO L93 Difference]: Finished difference Result 92 states and 143 transitions. [2020-10-09 13:18:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:41,538 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:41,539 INFO L225 Difference]: With dead ends: 92 [2020-10-09 13:18:41,539 INFO L226 Difference]: Without dead ends: 61 [2020-10-09 13:18:41,539 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-09 13:18:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-09 13:18:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-09 13:18:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2020-10-09 13:18:41,542 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 22 [2020-10-09 13:18:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:41,543 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 96 transitions. [2020-10-09 13:18:41,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2020-10-09 13:18:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:41,543 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:41,543 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-09 13:18:41,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-09 13:18:41,543 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:41,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:41,544 INFO L82 PathProgramCache]: Analyzing trace with hash -882669411, now seen corresponding path program 23 times [2020-10-09 13:18:41,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:41,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392322200] [2020-10-09 13:18:41,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:42,216 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-09 13:18:42,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392322200] [2020-10-09 13:18:42,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:42,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:42,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131982862] [2020-10-09 13:18:42,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:42,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:42,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:42,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:42,217 INFO L87 Difference]: Start difference. First operand 61 states and 96 transitions. Second operand 14 states. [2020-10-09 13:18:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:43,165 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2020-10-09 13:18:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:43,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:43,167 INFO L225 Difference]: With dead ends: 109 [2020-10-09 13:18:43,167 INFO L226 Difference]: Without dead ends: 84 [2020-10-09 13:18:43,168 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-09 13:18:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2020-10-09 13:18:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-09 13:18:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 110 transitions. [2020-10-09 13:18:43,171 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 110 transitions. Word has length 22 [2020-10-09 13:18:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:43,171 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 110 transitions. [2020-10-09 13:18:43,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 110 transitions. [2020-10-09 13:18:43,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:43,172 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:43,172 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-09 13:18:43,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-09 13:18:43,172 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash -419341219, now seen corresponding path program 24 times [2020-10-09 13:18:43,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:43,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160693971] [2020-10-09 13:18:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:43,739 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-09 13:18:43,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160693971] [2020-10-09 13:18:43,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:43,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:43,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498504464] [2020-10-09 13:18:43,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:43,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:43,740 INFO L87 Difference]: Start difference. First operand 69 states and 110 transitions. Second operand 14 states. [2020-10-09 13:18:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:44,722 INFO L93 Difference]: Finished difference Result 115 states and 180 transitions. [2020-10-09 13:18:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-09 13:18:44,723 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:44,724 INFO L225 Difference]: With dead ends: 115 [2020-10-09 13:18:44,724 INFO L226 Difference]: Without dead ends: 98 [2020-10-09 13:18:44,725 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-09 13:18:44,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-09 13:18:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2020-10-09 13:18:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-09 13:18:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2020-10-09 13:18:44,727 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 22 [2020-10-09 13:18:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:44,727 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2020-10-09 13:18:44,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2020-10-09 13:18:44,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:44,728 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:44,728 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-09 13:18:44,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-09 13:18:44,728 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:44,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1366701539, now seen corresponding path program 25 times [2020-10-09 13:18:44,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:44,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818162110] [2020-10-09 13:18:44,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:45,319 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-09 13:18:45,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818162110] [2020-10-09 13:18:45,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:45,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:45,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142287226] [2020-10-09 13:18:45,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:45,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:45,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:45,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:45,321 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand 14 states. [2020-10-09 13:18:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:46,175 INFO L93 Difference]: Finished difference Result 107 states and 164 transitions. [2020-10-09 13:18:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:18:46,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:46,176 INFO L225 Difference]: With dead ends: 107 [2020-10-09 13:18:46,176 INFO L226 Difference]: Without dead ends: 88 [2020-10-09 13:18:46,176 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-09 13:18:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2020-10-09 13:18:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-09 13:18:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 102 transitions. [2020-10-09 13:18:46,179 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 102 transitions. Word has length 22 [2020-10-09 13:18:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:46,179 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 102 transitions. [2020-10-09 13:18:46,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 102 transitions. [2020-10-09 13:18:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:46,180 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:46,180 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-09 13:18:46,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-09 13:18:46,180 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash -305746167, now seen corresponding path program 26 times [2020-10-09 13:18:46,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:46,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655669739] [2020-10-09 13:18:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:18:46,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655669739] [2020-10-09 13:18:46,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:46,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:46,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435566302] [2020-10-09 13:18:46,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:46,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:46,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:46,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:46,873 INFO L87 Difference]: Start difference. First operand 65 states and 102 transitions. Second operand 14 states. [2020-10-09 13:18:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:47,752 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2020-10-09 13:18:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:47,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:47,754 INFO L225 Difference]: With dead ends: 95 [2020-10-09 13:18:47,754 INFO L226 Difference]: Without dead ends: 59 [2020-10-09 13:18:47,755 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-09 13:18:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-09 13:18:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-09 13:18:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 92 transitions. [2020-10-09 13:18:47,757 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 92 transitions. Word has length 22 [2020-10-09 13:18:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:47,758 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 92 transitions. [2020-10-09 13:18:47,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 92 transitions. [2020-10-09 13:18:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:47,758 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:47,758 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-09 13:18:47,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-09 13:18:47,759 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:47,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2008695741, now seen corresponding path program 27 times [2020-10-09 13:18:47,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:47,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650870920] [2020-10-09 13:18:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:48,306 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-09 13:18:48,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650870920] [2020-10-09 13:18:48,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:48,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:48,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77488190] [2020-10-09 13:18:48,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:48,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:48,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:48,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:48,308 INFO L87 Difference]: Start difference. First operand 59 states and 92 transitions. Second operand 14 states. [2020-10-09 13:18:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:49,276 INFO L93 Difference]: Finished difference Result 88 states and 136 transitions. [2020-10-09 13:18:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:49,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:49,277 INFO L225 Difference]: With dead ends: 88 [2020-10-09 13:18:49,278 INFO L226 Difference]: Without dead ends: 63 [2020-10-09 13:18:49,278 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-09 13:18:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2020-10-09 13:18:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-09 13:18:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2020-10-09 13:18:49,280 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 22 [2020-10-09 13:18:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:49,281 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2020-10-09 13:18:49,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2020-10-09 13:18:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:49,281 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:49,281 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-09 13:18:49,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-09 13:18:49,282 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:49,282 INFO L82 PathProgramCache]: Analyzing trace with hash 287585121, now seen corresponding path program 28 times [2020-10-09 13:18:49,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:49,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774177238] [2020-10-09 13:18:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:49,942 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-09 13:18:49,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774177238] [2020-10-09 13:18:49,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:49,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:49,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444250984] [2020-10-09 13:18:49,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:49,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:49,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:49,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:49,947 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand 14 states. [2020-10-09 13:18:50,875 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2020-10-09 13:18:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:51,342 INFO L93 Difference]: Finished difference Result 85 states and 125 transitions. [2020-10-09 13:18:51,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-09 13:18:51,343 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:51,343 INFO L225 Difference]: With dead ends: 85 [2020-10-09 13:18:51,343 INFO L226 Difference]: Without dead ends: 68 [2020-10-09 13:18:51,344 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-09 13:18:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-09 13:18:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2020-10-09 13:18:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-09 13:18:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2020-10-09 13:18:51,345 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 22 [2020-10-09 13:18:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:51,345 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2020-10-09 13:18:51,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2020-10-09 13:18:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:51,346 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:51,347 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-09 13:18:51,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-09 13:18:51,347 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash -659775199, now seen corresponding path program 29 times [2020-10-09 13:18:51,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:51,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755478843] [2020-10-09 13:18:51,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:51,904 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-09 13:18:51,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755478843] [2020-10-09 13:18:51,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:51,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:51,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83360806] [2020-10-09 13:18:51,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:51,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:51,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:51,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:51,905 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand 14 states. [2020-10-09 13:18:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:52,753 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2020-10-09 13:18:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:18:52,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:52,755 INFO L225 Difference]: With dead ends: 77 [2020-10-09 13:18:52,755 INFO L226 Difference]: Without dead ends: 58 [2020-10-09 13:18:52,755 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-09 13:18:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2020-10-09 13:18:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-09 13:18:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2020-10-09 13:18:52,757 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 22 [2020-10-09 13:18:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:52,757 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2020-10-09 13:18:52,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2020-10-09 13:18:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 13:18:52,758 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:52,758 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-09 13:18:52,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-09 13:18:52,759 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:52,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1650897763, now seen corresponding path program 30 times [2020-10-09 13:18:52,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:52,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129639566] [2020-10-09 13:18:52,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:53,479 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-09 13:18:53,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129639566] [2020-10-09 13:18:53,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:53,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:53,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601951612] [2020-10-09 13:18:53,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:53,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:53,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:53,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:53,481 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand 14 states. [2020-10-09 13:18:54,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:54,518 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2020-10-09 13:18:54,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:54,518 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-09 13:18:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:54,518 INFO L225 Difference]: With dead ends: 48 [2020-10-09 13:18:54,518 INFO L226 Difference]: Without dead ends: 0 [2020-10-09 13:18:54,519 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-09 13:18:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-09 13:18:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-09 13:18:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-09 13:18:54,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-09 13:18:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:54,520 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-09 13:18:54,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-09 13:18:54,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-09 13:18:54,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-09 13:18:54,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 01:18:54 BasicIcfg [2020-10-09 13:18:54,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 13:18:54,525 INFO L168 Benchmark]: Toolchain (without parser) took 114016.59 ms. Allocated memory was 253.2 MB in the beginning and 710.9 MB in the end (delta: 457.7 MB). Free memory was 203.9 MB in the beginning and 441.4 MB in the end (delta: -237.5 MB). Peak memory consumption was 220.2 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:54,525 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 13:18:54,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1312.93 ms. Allocated memory was 253.2 MB in the beginning and 358.6 MB in the end (delta: 105.4 MB). Free memory was 203.9 MB in the beginning and 321.8 MB in the end (delta: -117.9 MB). Peak memory consumption was 107.3 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:54,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.14 ms. Allocated memory is still 358.6 MB. Free memory was 321.8 MB in the beginning and 318.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:54,526 INFO L168 Benchmark]: Boogie Preprocessor took 86.61 ms. Allocated memory is still 358.6 MB. Free memory was 318.6 MB in the beginning and 315.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:54,527 INFO L168 Benchmark]: RCFGBuilder took 765.79 ms. Allocated memory is still 358.6 MB. Free memory was 315.3 MB in the beginning and 266.9 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:54,527 INFO L168 Benchmark]: TraceAbstraction took 111713.16 ms. Allocated memory was 358.6 MB in the beginning and 710.9 MB in the end (delta: 352.3 MB). Free memory was 266.9 MB in the beginning and 441.4 MB in the end (delta: -174.5 MB). Peak memory consumption was 177.9 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:54,529 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.21 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1312.93 ms. Allocated memory was 253.2 MB in the beginning and 358.6 MB in the end (delta: 105.4 MB). Free memory was 203.9 MB in the beginning and 321.8 MB in the end (delta: -117.9 MB). Peak memory consumption was 107.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 133.14 ms. Allocated memory is still 358.6 MB. Free memory was 321.8 MB in the beginning and 318.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 86.61 ms. Allocated memory is still 358.6 MB. Free memory was 318.6 MB in the beginning and 315.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. * RCFGBuilder took 765.79 ms. Allocated memory is still 358.6 MB. Free memory was 315.3 MB in the beginning and 266.9 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 111713.16 ms. Allocated memory was 358.6 MB in the beginning and 710.9 MB in the end (delta: 352.3 MB). Free memory was 266.9 MB in the beginning and 441.4 MB in the end (delta: -174.5 MB). Peak memory consumption was 177.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1927 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 22 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 48.2s, 164 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 57.1s, 151 PlacesBefore, 41 PlacesAfterwards, 155 TransitionsBefore, 40 TransitionsAfterwards, 2884 CoEnabledTransitionPairs, 7 FixpointIterations, 87 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 167 TotalNumberOfCompositions, 6656 MoverChecksTotal - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 111.5s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 57.1s, HoareTripleCheckerStatistics: 854 SDtfs, 1700 SDslu, 4176 SDs, 0 SdLazy, 10914 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 23 SyntacticMatches, 72 SemanticMatches, 649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 32.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 40 MinimizatonAttempts, 742 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 414148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...