/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:23:34,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:23:34,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:23:34,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:23:34,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:23:34,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:23:34,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:23:34,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:23:34,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:23:34,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:23:34,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:23:34,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:23:34,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:23:34,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:23:34,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:23:34,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:23:34,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:23:34,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:23:34,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:23:34,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:23:34,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:23:34,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:23:34,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:23:34,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:23:34,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:23:34,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:23:34,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:23:34,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:23:34,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:23:34,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:23:34,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:23:34,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:23:34,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:23:34,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:23:34,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:23:34,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:23:34,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:23:34,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:23:34,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:23:34,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:23:34,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:23:34,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:23:34,539 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:23:34,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:23:34,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:23:34,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:23:34,541 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:23:34,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:23:34,541 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:23:34,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:23:34,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:23:34,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:23:34,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:23:34,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:23:34,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:23:34,542 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:23:34,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:23:34,543 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:23:34,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:23:34,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:23:34,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:23:34,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:23:34,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:23:34,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:23:34,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:23:34,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:23:34,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:23:34,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:23:34,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:23:34,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:23:34,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:23:34,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:23:34,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:23:34,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:23:34,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:23:34,853 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:23:34,853 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:23:34,854 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-16 11:23:34,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/db2ff8ea2/3f33b66fc49141e6b06343c28c71900b/FLAG26fb86930 [2020-10-16 11:23:35,584 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:23:35,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-16 11:23:35,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/db2ff8ea2/3f33b66fc49141e6b06343c28c71900b/FLAG26fb86930 [2020-10-16 11:23:35,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/db2ff8ea2/3f33b66fc49141e6b06343c28c71900b [2020-10-16 11:23:35,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:23:35,735 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:23:35,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:23:35,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:23:35,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:23:35,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:23:35" (1/1) ... [2020-10-16 11:23:35,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd64561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:35, skipping insertion in model container [2020-10-16 11:23:35,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:23:35" (1/1) ... [2020-10-16 11:23:35,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:23:35,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:23:36,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:23:36,565 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:23:36,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:23:37,044 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:23:37,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37 WrapperNode [2020-10-16 11:23:37,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:23:37,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:23:37,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:23:37,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:23:37,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... [2020-10-16 11:23:37,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... [2020-10-16 11:23:37,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:23:37,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:23:37,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:23:37,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:23:37,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... [2020-10-16 11:23:37,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... [2020-10-16 11:23:37,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... [2020-10-16 11:23:37,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... [2020-10-16 11:23:37,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... [2020-10-16 11:23:37,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... [2020-10-16 11:23:37,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... [2020-10-16 11:23:37,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:23:37,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:23:37,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:23:37,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:23:37,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 11:23:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:23:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 11:23:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-16 11:23:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-16 11:23:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:23:37,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:23:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-16 11:23:37,254 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-16 11:23:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:23:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:23:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 11:23:37,257 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:23:37,853 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:23:37,854 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-16 11:23:37,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:23:37 BoogieIcfgContainer [2020-10-16 11:23:37,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:23:37,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:23:37,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:23:37,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:23:37,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:23:35" (1/3) ... [2020-10-16 11:23:37,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6805a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:23:37, skipping insertion in model container [2020-10-16 11:23:37,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:23:37" (2/3) ... [2020-10-16 11:23:37,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6805a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:23:37, skipping insertion in model container [2020-10-16 11:23:37,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:23:37" (3/3) ... [2020-10-16 11:23:37,864 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-10-16 11:23:37,875 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:23:37,875 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:23:37,885 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-16 11:23:37,886 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:23:37,938 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,938 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,938 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,938 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,939 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,939 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,939 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,939 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,940 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,940 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,940 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,940 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,941 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,941 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,941 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,942 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,942 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,942 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,942 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,943 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,943 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,943 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,943 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,943 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,944 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,944 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,944 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,945 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,945 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,946 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,946 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,946 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,947 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,948 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,948 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,948 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,948 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,948 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,949 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,949 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,950 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,950 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,950 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,952 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,954 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,954 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,955 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,955 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,955 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,955 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,956 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,956 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,956 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,956 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,957 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,957 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,957 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,957 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,964 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,964 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,965 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,965 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,965 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,965 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,966 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,966 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,966 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,966 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,973 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,974 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,974 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,974 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,974 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,974 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,975 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,975 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,975 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,975 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:23:37,991 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-10-16 11:23:38,004 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-16 11:23:38,027 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:23:38,027 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:23:38,028 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:23:38,028 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:23:38,028 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:23:38,028 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:23:38,028 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:23:38,029 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:23:38,045 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:23:38,048 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions, 330 flow [2020-10-16 11:23:38,050 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 154 transitions, 330 flow [2020-10-16 11:23:38,052 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-10-16 11:23:38,127 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-10-16 11:23:38,128 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 11:23:38,133 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-16 11:23:38,139 INFO L117 LiptonReduction]: Number of co-enabled transitions 2652 [2020-10-16 11:23:38,392 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-16 11:23:38,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:38,426 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-16 11:23:38,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:38,450 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-16 11:23:38,450 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 11:23:38,470 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-16 11:23:38,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:38,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-16 11:23:38,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:38,525 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-16 11:23:38,527 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:23:40,811 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-16 11:23:40,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:40,851 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-16 11:23:40,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:40,874 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-16 11:23:40,874 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 11:23:40,894 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-16 11:23:40,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:40,929 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-16 11:23:40,957 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:40,959 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-16 11:23:40,959 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:23:43,035 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-16 11:23:43,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:43,061 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 11:23:43,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:43,081 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 11:23:43,081 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-16 11:23:43,095 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-16 11:23:43,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:43,121 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 11:23:43,145 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:43,146 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-16 11:23:43,147 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 11:23:45,187 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-16 11:23:45,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:45,227 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 11:23:45,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:45,244 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-16 11:23:45,245 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 11:23:45,255 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-16 11:23:45,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:45,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-16 11:23:45,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:45,301 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-16 11:23:45,301 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 11:23:47,525 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-16 11:23:47,550 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:47,554 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-16 11:23:47,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:47,573 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-16 11:23:47,574 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:23:47,586 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-16 11:23:47,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:47,617 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-16 11:23:47,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:47,635 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-16 11:23:47,636 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 11:23:50,001 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-16 11:23:50,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:50,029 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-16 11:23:50,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:50,052 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-16 11:23:50,053 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 11:23:50,069 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-16 11:23:50,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:50,094 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-16 11:23:50,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:50,109 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-16 11:23:50,110 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 11:23:52,303 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-16 11:23:52,332 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:52,336 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-16 11:23:52,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:52,357 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-16 11:23:52,358 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2020-10-16 11:23:52,393 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-16 11:23:52,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:52,428 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-16 11:23:52,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:52,454 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-16 11:23:52,455 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 11:23:52,471 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-16 11:23:52,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:52,497 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-16 11:23:52,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:52,518 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-16 11:23:52,518 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 11:23:54,589 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-16 11:23:54,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:54,618 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-16 11:23:54,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:54,638 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 11:23:54,639 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 11:23:54,658 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-16 11:23:54,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:54,683 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-16 11:23:54,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:54,701 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-16 11:23:54,702 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 11:23:56,728 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-16 11:23:56,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:56,754 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-16 11:23:56,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:56,773 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-16 11:23:56,774 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:23:56,787 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-16 11:23:56,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:56,812 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-16 11:23:56,834 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:56,835 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-16 11:23:56,836 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:23:58,895 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-16 11:23:58,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:58,921 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 11:23:58,959 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:58,960 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-16 11:23:58,960 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 11:23:58,977 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-16 11:23:59,004 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:59,010 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-16 11:23:59,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:23:59,034 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-16 11:23:59,034 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 11:24:01,058 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-16 11:24:01,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:01,084 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-16 11:24:01,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:01,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-16 11:24:01,101 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:01,112 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-16 11:24:01,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:01,147 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-16 11:24:01,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:01,183 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-16 11:24:01,183 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:03,530 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-16 11:24:03,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:03,556 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-16 11:24:03,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:03,575 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-16 11:24:03,575 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 11:24:03,583 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-16 11:24:03,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:03,610 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-16 11:24:03,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:03,627 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-16 11:24:03,627 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-16 11:24:05,643 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-16 11:24:05,673 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:05,677 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-16 11:24:05,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:05,704 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-16 11:24:05,704 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:05,721 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-16 11:24:05,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:05,747 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-16 11:24:05,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:05,766 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-16 11:24:05,766 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:07,989 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-16 11:24:08,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:08,024 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-16 11:24:08,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:08,046 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-16 11:24:08,047 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:08,065 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-16 11:24:08,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:08,103 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-16 11:24:08,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:08,148 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-16 11:24:08,149 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:10,444 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-16 11:24:10,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:10,473 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-16 11:24:10,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:10,489 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-16 11:24:10,490 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 11:24:10,499 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-16 11:24:10,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:10,523 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-16 11:24:10,541 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:10,542 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-16 11:24:10,542 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 11:24:12,679 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-16 11:24:12,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:12,700 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-16 11:24:12,717 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:12,718 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-16 11:24:12,718 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-16 11:24:12,734 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-16 11:24:12,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:12,755 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-16 11:24:12,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:12,771 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-16 11:24:12,772 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 11:24:14,788 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-16 11:24:14,807 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:14,810 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-16 11:24:14,832 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:14,833 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-16 11:24:14,833 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 11:24:14,843 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-16 11:24:14,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:14,867 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-16 11:24:14,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:14,887 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-16 11:24:14,887 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 11:24:16,986 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-16 11:24:17,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:17,015 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-16 11:24:17,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:17,030 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-16 11:24:17,031 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:17,040 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-16 11:24:17,069 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:17,073 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-16 11:24:17,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:17,099 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-16 11:24:17,099 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 11:24:19,168 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-16 11:24:19,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:19,194 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-16 11:24:19,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:19,209 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-16 11:24:19,209 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 11:24:19,216 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-16 11:24:19,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:19,247 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-16 11:24:19,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:19,265 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-16 11:24:19,265 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:21,343 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-16 11:24:21,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:21,365 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-16 11:24:21,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:21,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-16 11:24:21,384 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 11:24:21,398 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-16 11:24:21,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:21,430 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-16 11:24:21,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:21,450 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-16 11:24:21,450 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-16 11:24:23,661 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-16 11:24:23,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:23,688 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-16 11:24:23,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:23,709 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-16 11:24:23,709 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-16 11:24:23,725 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-16 11:24:23,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:23,754 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-16 11:24:23,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:23,775 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-16 11:24:23,775 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 11:24:25,917 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-16 11:24:25,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:25,939 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-16 11:24:25,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:25,959 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-16 11:24:25,960 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-16 11:24:25,980 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-16 11:24:26,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:26,005 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-16 11:24:26,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:26,029 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-16 11:24:26,029 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 11:24:26,044 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-16 11:24:26,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:26,071 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-16 11:24:26,097 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:26,098 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-16 11:24:26,099 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 11:24:28,116 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-16 11:24:28,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:28,144 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 11:24:28,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:28,167 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 11:24:28,167 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:28,176 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-16 11:24:28,206 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:28,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-16 11:24:28,234 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:28,234 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-16 11:24:28,235 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 11:24:30,255 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-16 11:24:30,275 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:30,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-16 11:24:30,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:30,304 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-16 11:24:30,304 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 11:24:30,317 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-16 11:24:30,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:30,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-16 11:24:30,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:30,355 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-16 11:24:30,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 11:24:33,803 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-10-16 11:24:33,909 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 11:24:34,267 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-10-16 11:24:34,287 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-16 11:24:34,407 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-16 11:24:34,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:34,411 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-16 11:24:34,570 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 11:24:34,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 11:24:34,572 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-16 11:24:34,572 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2020-10-16 11:24:34,742 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 11:24:35,944 WARN L193 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-16 11:24:36,371 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 11:24:36,839 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-16 11:24:37,044 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-16 11:24:37,057 INFO L132 LiptonReduction]: Checked pairs total: 6338 [2020-10-16 11:24:37,057 INFO L134 LiptonReduction]: Total number of compositions: 174 [2020-10-16 11:24:37,063 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2020-10-16 11:24:37,092 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2020-10-16 11:24:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2020-10-16 11:24:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-16 11:24:37,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:37,101 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-16 11:24:37,102 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-16 11:24:37,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2020-10-16 11:24:37,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:37,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839505099] [2020-10-16 11:24:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:37,334 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-16 11:24:37,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839505099] [2020-10-16 11:24:37,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:37,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-16 11:24:37,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497868116] [2020-10-16 11:24:37,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-16 11:24:37,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-16 11:24:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 11:24:37,365 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2020-10-16 11:24:37,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:37,397 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2020-10-16 11:24:37,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-16 11:24:37,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-16 11:24:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:37,414 INFO L225 Difference]: With dead ends: 386 [2020-10-16 11:24:37,414 INFO L226 Difference]: Without dead ends: 348 [2020-10-16 11:24:37,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 11:24:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-10-16 11:24:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2020-10-16 11:24:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-10-16 11:24:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2020-10-16 11:24:37,490 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2020-10-16 11:24:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:37,490 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2020-10-16 11:24:37,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-16 11:24:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2020-10-16 11:24:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-16 11:24:37,491 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:37,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-16 11:24:37,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:24:37,492 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-16 11:24:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 1 times [2020-10-16 11:24:37,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:37,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056773639] [2020-10-16 11:24:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:37,715 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-16 11:24:37,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056773639] [2020-10-16 11:24:37,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:37,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:24:37,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815068221] [2020-10-16 11:24:37,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:24:37,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:37,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:24:37,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:24:37,718 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2020-10-16 11:24:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:37,817 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2020-10-16 11:24:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:24:37,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-16 11:24:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:37,823 INFO L225 Difference]: With dead ends: 471 [2020-10-16 11:24:37,823 INFO L226 Difference]: Without dead ends: 471 [2020-10-16 11:24:37,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:24:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-10-16 11:24:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2020-10-16 11:24:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-16 11:24:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2020-10-16 11:24:37,857 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2020-10-16 11:24:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:37,857 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2020-10-16 11:24:37,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:24:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2020-10-16 11:24:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 11:24:37,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:37,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 11:24:37,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:24:37,859 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-16 11:24:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 1 times [2020-10-16 11:24:37,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:37,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033563063] [2020-10-16 11:24:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:37,932 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-16 11:24:37,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033563063] [2020-10-16 11:24:37,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:37,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:24:37,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174908310] [2020-10-16 11:24:37,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:24:37,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:37,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:24:37,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:24:37,934 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2020-10-16 11:24:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:38,010 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2020-10-16 11:24:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:24:38,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 11:24:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:38,014 INFO L225 Difference]: With dead ends: 498 [2020-10-16 11:24:38,014 INFO L226 Difference]: Without dead ends: 482 [2020-10-16 11:24:38,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:24:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-16 11:24:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2020-10-16 11:24:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 11:24:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2020-10-16 11:24:38,040 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2020-10-16 11:24:38,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:38,040 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2020-10-16 11:24:38,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:24:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2020-10-16 11:24:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 11:24:38,042 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:38,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:38,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:24:38,042 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-16 11:24:38,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 1 times [2020-10-16 11:24:38,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:38,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972703614] [2020-10-16 11:24:38,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:38,114 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-16 11:24:38,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972703614] [2020-10-16 11:24:38,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:38,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:24:38,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810639755] [2020-10-16 11:24:38,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:24:38,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:38,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:24:38,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:24:38,116 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2020-10-16 11:24:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:38,134 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-16 11:24:38,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:24:38,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 11:24:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:38,136 INFO L225 Difference]: With dead ends: 162 [2020-10-16 11:24:38,136 INFO L226 Difference]: Without dead ends: 162 [2020-10-16 11:24:38,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:24:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-16 11:24:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-16 11:24:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-16 11:24:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-16 11:24:38,143 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-16 11:24:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:38,143 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-16 11:24:38,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:24:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-16 11:24:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:38,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:38,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:38,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:24:38,153 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-16 11:24:38,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 1 times [2020-10-16 11:24:38,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:38,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128022597] [2020-10-16 11:24:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:38,374 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-16 11:24:38,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128022597] [2020-10-16 11:24:38,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:38,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:24:38,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582289269] [2020-10-16 11:24:38,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:24:38,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:24:38,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:24:38,378 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2020-10-16 11:24:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:38,512 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2020-10-16 11:24:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:24:38,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-16 11:24:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:38,514 INFO L225 Difference]: With dead ends: 206 [2020-10-16 11:24:38,514 INFO L226 Difference]: Without dead ends: 206 [2020-10-16 11:24:38,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:24:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-16 11:24:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2020-10-16 11:24:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-16 11:24:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2020-10-16 11:24:38,521 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2020-10-16 11:24:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:38,521 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2020-10-16 11:24:38,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:24:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2020-10-16 11:24:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:38,523 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:38,523 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:38,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:24:38,523 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-16 11:24:38,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:38,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 1 times [2020-10-16 11:24:38,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:38,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954418252] [2020-10-16 11:24:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:24:39,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954418252] [2020-10-16 11:24:39,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:39,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:39,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688163624] [2020-10-16 11:24:39,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:39,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:39,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:39,200 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 12 states. [2020-10-16 11:24:40,066 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-10-16 11:24:40,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:40,420 INFO L93 Difference]: Finished difference Result 314 states and 604 transitions. [2020-10-16 11:24:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 11:24:40,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:40,424 INFO L225 Difference]: With dead ends: 314 [2020-10-16 11:24:40,424 INFO L226 Difference]: Without dead ends: 314 [2020-10-16 11:24:40,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-10-16 11:24:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-16 11:24:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 248. [2020-10-16 11:24:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-16 11:24:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 493 transitions. [2020-10-16 11:24:40,434 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 493 transitions. Word has length 22 [2020-10-16 11:24:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:40,434 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 493 transitions. [2020-10-16 11:24:40,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 493 transitions. [2020-10-16 11:24:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:40,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:40,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:40,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:24:40,437 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-16 11:24:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 1 times [2020-10-16 11:24:40,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:40,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449457113] [2020-10-16 11:24:40,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:40,651 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-16 11:24:40,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449457113] [2020-10-16 11:24:40,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:40,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:24:40,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183147869] [2020-10-16 11:24:40,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:24:40,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:40,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:24:40,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:24:40,654 INFO L87 Difference]: Start difference. First operand 248 states and 493 transitions. Second operand 8 states. [2020-10-16 11:24:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:41,000 INFO L93 Difference]: Finished difference Result 369 states and 697 transitions. [2020-10-16 11:24:41,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:24:41,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-16 11:24:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:41,003 INFO L225 Difference]: With dead ends: 369 [2020-10-16 11:24:41,003 INFO L226 Difference]: Without dead ends: 319 [2020-10-16 11:24:41,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-10-16 11:24:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 247. [2020-10-16 11:24:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-16 11:24:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 491 transitions. [2020-10-16 11:24:41,011 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 491 transitions. Word has length 22 [2020-10-16 11:24:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:41,011 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 491 transitions. [2020-10-16 11:24:41,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:24:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 491 transitions. [2020-10-16 11:24:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:41,012 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:41,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:41,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:24:41,013 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-16 11:24:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:41,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732572, now seen corresponding path program 2 times [2020-10-16 11:24:41,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:41,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339871399] [2020-10-16 11:24:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:41,119 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-16 11:24:41,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339871399] [2020-10-16 11:24:41,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:41,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:24:41,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384469088] [2020-10-16 11:24:41,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:24:41,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:41,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:24:41,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:24:41,121 INFO L87 Difference]: Start difference. First operand 247 states and 491 transitions. Second operand 4 states. [2020-10-16 11:24:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:41,145 INFO L93 Difference]: Finished difference Result 162 states and 259 transitions. [2020-10-16 11:24:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:24:41,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-16 11:24:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:41,146 INFO L225 Difference]: With dead ends: 162 [2020-10-16 11:24:41,147 INFO L226 Difference]: Without dead ends: 157 [2020-10-16 11:24:41,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:24:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-16 11:24:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2020-10-16 11:24:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-16 11:24:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 253 transitions. [2020-10-16 11:24:41,153 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 253 transitions. Word has length 22 [2020-10-16 11:24:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:41,153 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 253 transitions. [2020-10-16 11:24:41,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:24:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 253 transitions. [2020-10-16 11:24:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:41,154 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:41,154 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:41,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:24:41,155 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-16 11:24:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash 472795278, now seen corresponding path program 2 times [2020-10-16 11:24:41,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:41,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304754216] [2020-10-16 11:24:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:41,340 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-16 11:24:41,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304754216] [2020-10-16 11:24:41,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:41,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:24:41,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535571840] [2020-10-16 11:24:41,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:24:41,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:24:41,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:24:41,343 INFO L87 Difference]: Start difference. First operand 156 states and 253 transitions. Second operand 8 states. [2020-10-16 11:24:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:41,626 INFO L93 Difference]: Finished difference Result 151 states and 239 transitions. [2020-10-16 11:24:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:24:41,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-16 11:24:41,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:41,628 INFO L225 Difference]: With dead ends: 151 [2020-10-16 11:24:41,628 INFO L226 Difference]: Without dead ends: 151 [2020-10-16 11:24:41,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-10-16 11:24:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2020-10-16 11:24:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-16 11:24:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2020-10-16 11:24:41,633 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 22 [2020-10-16 11:24:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:41,633 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2020-10-16 11:24:41,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:24:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2020-10-16 11:24:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:41,634 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:41,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:41,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:24:41,635 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-16 11:24:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1729521388, now seen corresponding path program 3 times [2020-10-16 11:24:41,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:41,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090760929] [2020-10-16 11:24:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:42,266 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-16 11:24:42,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090760929] [2020-10-16 11:24:42,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:42,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:42,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967490620] [2020-10-16 11:24:42,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:42,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:42,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:42,268 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand 12 states. [2020-10-16 11:24:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:42,916 INFO L93 Difference]: Finished difference Result 144 states and 221 transitions. [2020-10-16 11:24:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 11:24:42,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:42,918 INFO L225 Difference]: With dead ends: 144 [2020-10-16 11:24:42,918 INFO L226 Difference]: Without dead ends: 131 [2020-10-16 11:24:42,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-10-16 11:24:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-16 11:24:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2020-10-16 11:24:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-16 11:24:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 207 transitions. [2020-10-16 11:24:42,922 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 207 transitions. Word has length 22 [2020-10-16 11:24:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:42,923 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 207 transitions. [2020-10-16 11:24:42,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 207 transitions. [2020-10-16 11:24:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:42,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:42,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:42,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:24:42,924 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-16 11:24:42,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1321376162, now seen corresponding path program 4 times [2020-10-16 11:24:42,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:42,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480566779] [2020-10-16 11:24:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:43,426 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-16 11:24:43,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480566779] [2020-10-16 11:24:43,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:43,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:43,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047468081] [2020-10-16 11:24:43,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:43,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:43,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:43,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:43,427 INFO L87 Difference]: Start difference. First operand 130 states and 207 transitions. Second operand 12 states. [2020-10-16 11:24:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:44,095 INFO L93 Difference]: Finished difference Result 142 states and 218 transitions. [2020-10-16 11:24:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 11:24:44,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:44,097 INFO L225 Difference]: With dead ends: 142 [2020-10-16 11:24:44,097 INFO L226 Difference]: Without dead ends: 130 [2020-10-16 11:24:44,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-16 11:24:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-16 11:24:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-16 11:24:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-16 11:24:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 205 transitions. [2020-10-16 11:24:44,101 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 205 transitions. Word has length 22 [2020-10-16 11:24:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:44,101 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 205 transitions. [2020-10-16 11:24:44,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 205 transitions. [2020-10-16 11:24:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:44,102 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:44,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:44,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:24:44,102 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-16 11:24:44,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:44,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400266, now seen corresponding path program 5 times [2020-10-16 11:24:44,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:44,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014682476] [2020-10-16 11:24:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:44,588 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-16 11:24:44,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014682476] [2020-10-16 11:24:44,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:44,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:44,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569696023] [2020-10-16 11:24:44,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:44,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:44,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:44,591 INFO L87 Difference]: Start difference. First operand 130 states and 205 transitions. Second operand 12 states. [2020-10-16 11:24:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:45,306 INFO L93 Difference]: Finished difference Result 149 states and 230 transitions. [2020-10-16 11:24:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 11:24:45,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:45,308 INFO L225 Difference]: With dead ends: 149 [2020-10-16 11:24:45,308 INFO L226 Difference]: Without dead ends: 149 [2020-10-16 11:24:45,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-16 11:24:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2020-10-16 11:24:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-16 11:24:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2020-10-16 11:24:45,312 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 22 [2020-10-16 11:24:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:45,313 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2020-10-16 11:24:45,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2020-10-16 11:24:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:45,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:45,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:45,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:24:45,314 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-16 11:24:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:45,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400276, now seen corresponding path program 2 times [2020-10-16 11:24:45,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:45,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65134716] [2020-10-16 11:24:45,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:45,457 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-16 11:24:45,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65134716] [2020-10-16 11:24:45,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:45,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:24:45,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981344291] [2020-10-16 11:24:45,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:24:45,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:45,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:24:45,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:24:45,459 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand 8 states. [2020-10-16 11:24:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:45,708 INFO L93 Difference]: Finished difference Result 191 states and 287 transitions. [2020-10-16 11:24:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:24:45,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-16 11:24:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:45,710 INFO L225 Difference]: With dead ends: 191 [2020-10-16 11:24:45,710 INFO L226 Difference]: Without dead ends: 165 [2020-10-16 11:24:45,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-16 11:24:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 128. [2020-10-16 11:24:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-16 11:24:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 199 transitions. [2020-10-16 11:24:45,714 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 199 transitions. Word has length 22 [2020-10-16 11:24:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:45,715 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 199 transitions. [2020-10-16 11:24:45,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:24:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2020-10-16 11:24:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:45,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:45,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:45,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:24:45,716 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-16 11:24:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2057875200, now seen corresponding path program 3 times [2020-10-16 11:24:45,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:45,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613408809] [2020-10-16 11:24:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:45,922 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-16 11:24:45,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613408809] [2020-10-16 11:24:45,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:45,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:45,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150737627] [2020-10-16 11:24:45,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 11:24:45,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:45,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 11:24:45,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:24:45,924 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand 11 states. [2020-10-16 11:24:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:46,525 INFO L93 Difference]: Finished difference Result 245 states and 383 transitions. [2020-10-16 11:24:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 11:24:46,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-16 11:24:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:46,527 INFO L225 Difference]: With dead ends: 245 [2020-10-16 11:24:46,527 INFO L226 Difference]: Without dead ends: 230 [2020-10-16 11:24:46,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2020-10-16 11:24:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-16 11:24:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 141. [2020-10-16 11:24:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-16 11:24:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 227 transitions. [2020-10-16 11:24:46,535 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 227 transitions. Word has length 22 [2020-10-16 11:24:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:46,535 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 227 transitions. [2020-10-16 11:24:46,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 11:24:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 227 transitions. [2020-10-16 11:24:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:46,537 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:46,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:46,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:24:46,538 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-16 11:24:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash -761551564, now seen corresponding path program 6 times [2020-10-16 11:24:46,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:46,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192449463] [2020-10-16 11:24:46,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:46,876 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2020-10-16 11:24:47,103 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-16 11:24:47,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192449463] [2020-10-16 11:24:47,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:47,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:47,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746537688] [2020-10-16 11:24:47,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:47,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:47,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:47,106 INFO L87 Difference]: Start difference. First operand 141 states and 227 transitions. Second operand 12 states. [2020-10-16 11:24:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:47,699 INFO L93 Difference]: Finished difference Result 148 states and 233 transitions. [2020-10-16 11:24:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 11:24:47,700 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:47,702 INFO L225 Difference]: With dead ends: 148 [2020-10-16 11:24:47,702 INFO L226 Difference]: Without dead ends: 137 [2020-10-16 11:24:47,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-16 11:24:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-16 11:24:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-16 11:24:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 219 transitions. [2020-10-16 11:24:47,706 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 219 transitions. Word has length 22 [2020-10-16 11:24:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:47,707 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 219 transitions. [2020-10-16 11:24:47,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 219 transitions. [2020-10-16 11:24:47,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:47,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:47,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:47,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:24:47,708 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-16 11:24:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:47,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1314893868, now seen corresponding path program 7 times [2020-10-16 11:24:47,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:47,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103999412] [2020-10-16 11:24:47,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:48,192 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-16 11:24:48,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103999412] [2020-10-16 11:24:48,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:48,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:48,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831364261] [2020-10-16 11:24:48,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:48,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:48,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:48,194 INFO L87 Difference]: Start difference. First operand 137 states and 219 transitions. Second operand 12 states. [2020-10-16 11:24:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:48,792 INFO L93 Difference]: Finished difference Result 145 states and 226 transitions. [2020-10-16 11:24:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 11:24:48,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:48,794 INFO L225 Difference]: With dead ends: 145 [2020-10-16 11:24:48,794 INFO L226 Difference]: Without dead ends: 121 [2020-10-16 11:24:48,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-16 11:24:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-16 11:24:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-16 11:24:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 194 transitions. [2020-10-16 11:24:48,799 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 194 transitions. Word has length 22 [2020-10-16 11:24:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:48,799 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 194 transitions. [2020-10-16 11:24:48,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 194 transitions. [2020-10-16 11:24:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:48,800 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:48,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:48,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 11:24:48,800 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-16 11:24:48,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:48,801 INFO L82 PathProgramCache]: Analyzing trace with hash -149449002, now seen corresponding path program 8 times [2020-10-16 11:24:48,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:48,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058860738] [2020-10-16 11:24:48,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:49,348 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-16 11:24:49,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058860738] [2020-10-16 11:24:49,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:49,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:49,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566092126] [2020-10-16 11:24:49,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:49,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:49,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:49,350 INFO L87 Difference]: Start difference. First operand 121 states and 194 transitions. Second operand 12 states. [2020-10-16 11:24:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:49,916 INFO L93 Difference]: Finished difference Result 121 states and 193 transitions. [2020-10-16 11:24:49,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 11:24:49,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:49,918 INFO L225 Difference]: With dead ends: 121 [2020-10-16 11:24:49,918 INFO L226 Difference]: Without dead ends: 106 [2020-10-16 11:24:49,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-16 11:24:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-16 11:24:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-16 11:24:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 178 transitions. [2020-10-16 11:24:49,922 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 178 transitions. Word has length 22 [2020-10-16 11:24:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:49,922 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 178 transitions. [2020-10-16 11:24:49,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 178 transitions. [2020-10-16 11:24:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:49,923 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:49,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:49,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 11:24:49,924 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-16 11:24:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -552633476, now seen corresponding path program 9 times [2020-10-16 11:24:49,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:49,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849759605] [2020-10-16 11:24:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:50,454 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-16 11:24:50,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849759605] [2020-10-16 11:24:50,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:50,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:50,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708634991] [2020-10-16 11:24:50,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:50,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:50,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:50,456 INFO L87 Difference]: Start difference. First operand 106 states and 178 transitions. Second operand 12 states. [2020-10-16 11:24:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:51,036 INFO L93 Difference]: Finished difference Result 137 states and 223 transitions. [2020-10-16 11:24:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 11:24:51,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:51,038 INFO L225 Difference]: With dead ends: 137 [2020-10-16 11:24:51,038 INFO L226 Difference]: Without dead ends: 137 [2020-10-16 11:24:51,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:51,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-16 11:24:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2020-10-16 11:24:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-16 11:24:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 223 transitions. [2020-10-16 11:24:51,043 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 223 transitions. Word has length 22 [2020-10-16 11:24:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:51,044 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 223 transitions. [2020-10-16 11:24:51,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 223 transitions. [2020-10-16 11:24:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:51,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:51,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:51,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 11:24:51,045 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-16 11:24:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:51,045 INFO L82 PathProgramCache]: Analyzing trace with hash -552633486, now seen corresponding path program 3 times [2020-10-16 11:24:51,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:51,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855416762] [2020-10-16 11:24:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:51,203 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-16 11:24:51,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855416762] [2020-10-16 11:24:51,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:51,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:24:51,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857295560] [2020-10-16 11:24:51,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:24:51,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:51,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:24:51,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:24:51,206 INFO L87 Difference]: Start difference. First operand 136 states and 223 transitions. Second operand 8 states. [2020-10-16 11:24:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:51,451 INFO L93 Difference]: Finished difference Result 166 states and 269 transitions. [2020-10-16 11:24:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:24:51,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-16 11:24:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:51,452 INFO L225 Difference]: With dead ends: 166 [2020-10-16 11:24:51,452 INFO L226 Difference]: Without dead ends: 135 [2020-10-16 11:24:51,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-16 11:24:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-10-16 11:24:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-16 11:24:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 223 transitions. [2020-10-16 11:24:51,456 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 223 transitions. Word has length 22 [2020-10-16 11:24:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:51,457 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 223 transitions. [2020-10-16 11:24:51,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:24:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 223 transitions. [2020-10-16 11:24:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:51,458 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:51,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:51,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 11:24:51,458 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-16 11:24:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:51,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1930461660, now seen corresponding path program 10 times [2020-10-16 11:24:51,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:51,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083230054] [2020-10-16 11:24:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:52,140 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-16 11:24:52,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083230054] [2020-10-16 11:24:52,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:52,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:52,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671322523] [2020-10-16 11:24:52,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:52,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:52,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:52,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:52,142 INFO L87 Difference]: Start difference. First operand 135 states and 223 transitions. Second operand 12 states. [2020-10-16 11:24:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:52,784 INFO L93 Difference]: Finished difference Result 174 states and 282 transitions. [2020-10-16 11:24:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 11:24:52,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:52,785 INFO L225 Difference]: With dead ends: 174 [2020-10-16 11:24:52,785 INFO L226 Difference]: Without dead ends: 132 [2020-10-16 11:24:52,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-16 11:24:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-16 11:24:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-16 11:24:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 216 transitions. [2020-10-16 11:24:52,789 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 216 transitions. Word has length 22 [2020-10-16 11:24:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:52,789 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 216 transitions. [2020-10-16 11:24:52,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 216 transitions. [2020-10-16 11:24:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:52,790 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:52,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:52,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 11:24:52,791 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-16 11:24:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash 571806310, now seen corresponding path program 11 times [2020-10-16 11:24:52,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:52,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002825109] [2020-10-16 11:24:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:53,355 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-16 11:24:53,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002825109] [2020-10-16 11:24:53,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:53,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:53,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996529622] [2020-10-16 11:24:53,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:53,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:53,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:53,357 INFO L87 Difference]: Start difference. First operand 132 states and 216 transitions. Second operand 12 states. [2020-10-16 11:24:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:53,981 INFO L93 Difference]: Finished difference Result 169 states and 273 transitions. [2020-10-16 11:24:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 11:24:53,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:53,983 INFO L225 Difference]: With dead ends: 169 [2020-10-16 11:24:53,983 INFO L226 Difference]: Without dead ends: 132 [2020-10-16 11:24:53,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-16 11:24:53,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-16 11:24:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-16 11:24:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 212 transitions. [2020-10-16 11:24:53,988 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 212 transitions. Word has length 22 [2020-10-16 11:24:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:53,988 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 212 transitions. [2020-10-16 11:24:53,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 212 transitions. [2020-10-16 11:24:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:53,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:53,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:53,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 11:24:53,989 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-16 11:24:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019498, now seen corresponding path program 12 times [2020-10-16 11:24:53,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:53,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396428425] [2020-10-16 11:24:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:54,558 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-16 11:24:54,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396428425] [2020-10-16 11:24:54,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:54,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:54,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729845594] [2020-10-16 11:24:54,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:54,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:54,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:54,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:54,560 INFO L87 Difference]: Start difference. First operand 132 states and 212 transitions. Second operand 12 states. [2020-10-16 11:24:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:55,234 INFO L93 Difference]: Finished difference Result 153 states and 241 transitions. [2020-10-16 11:24:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 11:24:55,235 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:55,236 INFO L225 Difference]: With dead ends: 153 [2020-10-16 11:24:55,236 INFO L226 Difference]: Without dead ends: 153 [2020-10-16 11:24:55,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-16 11:24:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2020-10-16 11:24:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-16 11:24:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 241 transitions. [2020-10-16 11:24:55,240 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 241 transitions. Word has length 22 [2020-10-16 11:24:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:55,240 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 241 transitions. [2020-10-16 11:24:55,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 241 transitions. [2020-10-16 11:24:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:55,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:55,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:55,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 11:24:55,242 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-16 11:24:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019508, now seen corresponding path program 4 times [2020-10-16 11:24:55,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:55,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704671341] [2020-10-16 11:24:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:24:55,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704671341] [2020-10-16 11:24:55,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:55,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:24:55,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169400929] [2020-10-16 11:24:55,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:24:55,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:55,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:24:55,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:24:55,380 INFO L87 Difference]: Start difference. First operand 152 states and 241 transitions. Second operand 8 states. [2020-10-16 11:24:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:55,624 INFO L93 Difference]: Finished difference Result 161 states and 251 transitions. [2020-10-16 11:24:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:24:55,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-16 11:24:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:55,626 INFO L225 Difference]: With dead ends: 161 [2020-10-16 11:24:55,626 INFO L226 Difference]: Without dead ends: 131 [2020-10-16 11:24:55,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-16 11:24:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2020-10-16 11:24:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-16 11:24:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2020-10-16 11:24:55,630 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 22 [2020-10-16 11:24:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:55,630 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-16 11:24:55,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:24:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2020-10-16 11:24:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:55,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:55,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:55,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 11:24:55,631 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-16 11:24:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323498, now seen corresponding path program 13 times [2020-10-16 11:24:55,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:55,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227966967] [2020-10-16 11:24:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:56,208 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-16 11:24:56,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227966967] [2020-10-16 11:24:56,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:56,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:56,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659770236] [2020-10-16 11:24:56,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:56,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:56,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:56,210 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand 12 states. [2020-10-16 11:24:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:56,926 INFO L93 Difference]: Finished difference Result 130 states and 200 transitions. [2020-10-16 11:24:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 11:24:56,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:56,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:56,927 INFO L225 Difference]: With dead ends: 130 [2020-10-16 11:24:56,927 INFO L226 Difference]: Without dead ends: 110 [2020-10-16 11:24:56,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-16 11:24:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-16 11:24:56,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-10-16 11:24:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-16 11:24:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2020-10-16 11:24:56,931 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 22 [2020-10-16 11:24:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:56,931 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2020-10-16 11:24:56,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-10-16 11:24:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:56,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:56,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:56,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 11:24:56,932 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-16 11:24:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:56,933 INFO L82 PathProgramCache]: Analyzing trace with hash 280732566, now seen corresponding path program 14 times [2020-10-16 11:24:56,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:56,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906271568] [2020-10-16 11:24:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:57,429 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-16 11:24:57,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906271568] [2020-10-16 11:24:57,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:57,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:57,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403179672] [2020-10-16 11:24:57,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:57,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:57,431 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 12 states. [2020-10-16 11:24:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:58,057 INFO L93 Difference]: Finished difference Result 120 states and 178 transitions. [2020-10-16 11:24:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 11:24:58,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:58,059 INFO L225 Difference]: With dead ends: 120 [2020-10-16 11:24:58,059 INFO L226 Difference]: Without dead ends: 76 [2020-10-16 11:24:58,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-16 11:24:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2020-10-16 11:24:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-16 11:24:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2020-10-16 11:24:58,064 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 22 [2020-10-16 11:24:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:58,064 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2020-10-16 11:24:58,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2020-10-16 11:24:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:24:58,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:24:58,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:24:58,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 11:24:58,066 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-16 11:24:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:24:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash 779226054, now seen corresponding path program 15 times [2020-10-16 11:24:58,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:24:58,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791645951] [2020-10-16 11:24:58,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:24:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:24:58,648 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-16 11:24:58,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791645951] [2020-10-16 11:24:58,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:24:58,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 11:24:58,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692736538] [2020-10-16 11:24:58,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 11:24:58,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:24:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 11:24:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:24:58,652 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 12 states. [2020-10-16 11:24:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:24:59,196 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-10-16 11:24:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 11:24:59,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-16 11:24:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:24:59,197 INFO L225 Difference]: With dead ends: 66 [2020-10-16 11:24:59,197 INFO L226 Difference]: Without dead ends: 0 [2020-10-16 11:24:59,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-16 11:24:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-16 11:24:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-16 11:24:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-16 11:24:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-16 11:24:59,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-16 11:24:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:24:59,198 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-16 11:24:59,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 11:24:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-16 11:24:59,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-16 11:24:59,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 11:24:59,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:24:59 BasicIcfg [2020-10-16 11:24:59,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:24:59,209 INFO L168 Benchmark]: Toolchain (without parser) took 83474.66 ms. Allocated memory was 137.9 MB in the beginning and 476.1 MB in the end (delta: 338.2 MB). Free memory was 97.9 MB in the beginning and 138.5 MB in the end (delta: -40.6 MB). Peak memory consumption was 297.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:24:59,211 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-16 11:24:59,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1307.57 ms. Allocated memory was 137.9 MB in the beginning and 232.3 MB in the end (delta: 94.4 MB). Free memory was 97.9 MB in the beginning and 169.3 MB in the end (delta: -71.4 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:24:59,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.95 ms. Allocated memory is still 232.3 MB. Free memory was 169.3 MB in the beginning and 165.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:24:59,212 INFO L168 Benchmark]: Boogie Preprocessor took 46.19 ms. Allocated memory is still 232.3 MB. Free memory was 165.8 MB in the beginning and 162.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:24:59,212 INFO L168 Benchmark]: RCFGBuilder took 674.74 ms. Allocated memory is still 232.3 MB. Free memory was 162.3 MB in the beginning and 113.8 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:24:59,212 INFO L168 Benchmark]: TraceAbstraction took 81349.93 ms. Allocated memory was 232.3 MB in the beginning and 476.1 MB in the end (delta: 243.8 MB). Free memory was 113.8 MB in the beginning and 138.5 MB in the end (delta: -24.7 MB). Peak memory consumption was 219.1 MB. Max. memory is 7.1 GB. [2020-10-16 11:24:59,215 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 137.9 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1307.57 ms. Allocated memory was 137.9 MB in the beginning and 232.3 MB in the end (delta: 94.4 MB). Free memory was 97.9 MB in the beginning and 169.3 MB in the end (delta: -71.4 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.95 ms. Allocated memory is still 232.3 MB. Free memory was 169.3 MB in the beginning and 165.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.19 ms. Allocated memory is still 232.3 MB. Free memory was 165.8 MB in the beginning and 162.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 674.74 ms. Allocated memory is still 232.3 MB. Free memory was 162.3 MB in the beginning and 113.8 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81349.93 ms. Allocated memory was 232.3 MB in the beginning and 476.1 MB in the end (delta: 243.8 MB). Free memory was 113.8 MB in the beginning and 138.5 MB in the end (delta: -24.7 MB). Peak memory consumption was 219.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1759 VarBasedMoverChecksPositive, 69 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 24 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 51.8s, 140 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 59.0s, 150 PlacesBefore, 40 PlacesAfterwards, 154 TransitionsBefore, 38 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 7 FixpointIterations, 90 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 174 TotalNumberOfCompositions, 6338 MoverChecksTotal - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 81.1s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 59.0s, HoareTripleCheckerStatistics: 626 SDtfs, 908 SDslu, 2076 SDs, 0 SdLazy, 4679 SolverSat, 441 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 22 SyntacticMatches, 33 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 446 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 198300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...