/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:31:22,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:31:22,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:31:22,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:31:22,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:31:22,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:31:22,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:31:22,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:31:22,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:31:22,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:31:22,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:31:22,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:31:22,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:31:22,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:31:22,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:31:22,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:31:22,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:31:22,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:31:22,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:31:22,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:31:22,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:31:22,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:31:22,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:31:22,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:31:22,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:31:22,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:31:22,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:31:22,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:31:22,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:31:22,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:31:22,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:31:22,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:31:22,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:31:22,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:31:22,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:31:22,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:31:22,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:31:22,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:31:22,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:31:22,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:31:22,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:31:22,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 02:31:22,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:31:22,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:31:22,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:31:22,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:31:22,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:31:22,793 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:31:22,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:31:22,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:31:22,794 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:31:22,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:31:22,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:31:22,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:31:22,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:31:22,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:31:22,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:31:22,795 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:31:22,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:31:22,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:31:22,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:31:22,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:31:22,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:31:22,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:31:22,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:31:22,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:31:22,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:31:22,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:31:22,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:31:22,796 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:31:22,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:31:22,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:31:22,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:31:23,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:31:23,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:31:23,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:31:23,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:31:23,052 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:31:23,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-01-10 02:31:23,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32adf17d/26e4258df5a54ae58324b0c83e177ea6/FLAG2b1b8f190 [2022-01-10 02:31:23,530 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:31:23,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-01-10 02:31:23,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32adf17d/26e4258df5a54ae58324b0c83e177ea6/FLAG2b1b8f190 [2022-01-10 02:31:23,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32adf17d/26e4258df5a54ae58324b0c83e177ea6 [2022-01-10 02:31:23,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:31:23,554 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:31:23,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:31:23,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:31:23,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:31:23,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa0985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23, skipping insertion in model container [2022-01-10 02:31:23,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:31:23,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:31:23,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-01-10 02:31:23,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-01-10 02:31:23,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:31:23,820 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:31:23,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-01-10 02:31:23,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-01-10 02:31:23,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:31:23,900 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:31:23,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23 WrapperNode [2022-01-10 02:31:23,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:31:23,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:31:23,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:31:23,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:31:23,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,945 INFO L137 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 417 [2022-01-10 02:31:23,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:31:23,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:31:23,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:31:23,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:31:23,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:23,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:31:23,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:31:23,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:31:23,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:31:24,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (1/1) ... [2022-01-10 02:31:24,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:31:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:31:24,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:31:24,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 02:31:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:31:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:31:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:31:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-01-10 02:31:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-01-10 02:31:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:31:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:31:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:31:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:31:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:31:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:31:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:31:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:31:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:31:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:31:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:31:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:31:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:31:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:31:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:31:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:31:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:31:24,140 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:31:24,141 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:31:24,450 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:31:24,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:31:24,456 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 02:31:24,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:31:24 BoogieIcfgContainer [2022-01-10 02:31:24,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:31:24,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:31:24,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:31:24,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:31:24,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:31:23" (1/3) ... [2022-01-10 02:31:24,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcba455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:31:24, skipping insertion in model container [2022-01-10 02:31:24,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:23" (2/3) ... [2022-01-10 02:31:24,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcba455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:31:24, skipping insertion in model container [2022-01-10 02:31:24,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:31:24" (3/3) ... [2022-01-10 02:31:24,462 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-01-10 02:31:24,466 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:31:24,466 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:31:24,492 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:31:24,496 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:31:24,497 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:31:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-01-10 02:31:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 02:31:24,513 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:24,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:24,513 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1946471914, now seen corresponding path program 1 times [2022-01-10 02:31:24,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:24,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448611557] [2022-01-10 02:31:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:24,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:31:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-10 02:31:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:24,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:24,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448611557] [2022-01-10 02:31:24,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448611557] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:24,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:24,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:31:24,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113572605] [2022-01-10 02:31:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:24,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:31:24,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:24,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:31:24,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:31:24,759 INFO L87 Difference]: Start difference. First operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 02:31:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:24,963 INFO L93 Difference]: Finished difference Result 414 states and 624 transitions. [2022-01-10 02:31:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:31:24,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-01-10 02:31:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:24,978 INFO L225 Difference]: With dead ends: 414 [2022-01-10 02:31:24,979 INFO L226 Difference]: Without dead ends: 239 [2022-01-10 02:31:24,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:31:24,988 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 284 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:24,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 471 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:31:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-01-10 02:31:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2022-01-10 02:31:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-01-10 02:31:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 328 transitions. [2022-01-10 02:31:25,051 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 328 transitions. Word has length 44 [2022-01-10 02:31:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:25,052 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 328 transitions. [2022-01-10 02:31:25,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 02:31:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 328 transitions. [2022-01-10 02:31:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 02:31:25,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:25,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:25,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:31:25,058 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:25,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1644174286, now seen corresponding path program 1 times [2022-01-10 02:31:25,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:25,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061300327] [2022-01-10 02:31:25,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:25,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:31:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 02:31:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:25,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:25,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061300327] [2022-01-10 02:31:25,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061300327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:25,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:25,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:31:25,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807279938] [2022-01-10 02:31:25,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:25,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:31:25,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:25,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:31:25,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:31:25,136 INFO L87 Difference]: Start difference. First operand 233 states and 328 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 02:31:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:25,278 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2022-01-10 02:31:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:31:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-01-10 02:31:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:25,286 INFO L225 Difference]: With dead ends: 481 [2022-01-10 02:31:25,286 INFO L226 Difference]: Without dead ends: 357 [2022-01-10 02:31:25,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:31:25,287 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 148 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:25,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 568 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:31:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-01-10 02:31:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2022-01-10 02:31:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-01-10 02:31:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 418 transitions. [2022-01-10 02:31:25,302 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 418 transitions. Word has length 45 [2022-01-10 02:31:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:25,303 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 418 transitions. [2022-01-10 02:31:25,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 02:31:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 418 transitions. [2022-01-10 02:31:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 02:31:25,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:25,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:25,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:31:25,304 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:25,305 INFO L85 PathProgramCache]: Analyzing trace with hash 359816825, now seen corresponding path program 1 times [2022-01-10 02:31:25,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:25,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918560947] [2022-01-10 02:31:25,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:25,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:31:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 02:31:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:25,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:25,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918560947] [2022-01-10 02:31:25,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918560947] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:25,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:25,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:31:25,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739461688] [2022-01-10 02:31:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:25,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:31:25,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:25,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:31:25,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:31:25,345 INFO L87 Difference]: Start difference. First operand 300 states and 418 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 02:31:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:25,437 INFO L93 Difference]: Finished difference Result 708 states and 977 transitions. [2022-01-10 02:31:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:31:25,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-01-10 02:31:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:25,439 INFO L225 Difference]: With dead ends: 708 [2022-01-10 02:31:25,439 INFO L226 Difference]: Without dead ends: 517 [2022-01-10 02:31:25,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:31:25,441 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 293 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:25,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 462 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:31:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-01-10 02:31:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 465. [2022-01-10 02:31:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-01-10 02:31:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 636 transitions. [2022-01-10 02:31:25,459 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 636 transitions. Word has length 45 [2022-01-10 02:31:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:25,459 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 636 transitions. [2022-01-10 02:31:25,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 02:31:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 636 transitions. [2022-01-10 02:31:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:25,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:25,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:25,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:31:25,461 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash -443803124, now seen corresponding path program 1 times [2022-01-10 02:31:25,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:25,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657576148] [2022-01-10 02:31:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:25,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:25,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:25,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657576148] [2022-01-10 02:31:25,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657576148] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:25,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:25,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:31:25,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838788242] [2022-01-10 02:31:25,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:25,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:31:25,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:25,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:31:25,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:31:25,519 INFO L87 Difference]: Start difference. First operand 465 states and 636 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:25,744 INFO L93 Difference]: Finished difference Result 582 states and 808 transitions. [2022-01-10 02:31:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:31:25,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:25,747 INFO L225 Difference]: With dead ends: 582 [2022-01-10 02:31:25,747 INFO L226 Difference]: Without dead ends: 486 [2022-01-10 02:31:25,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:31:25,748 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 263 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:25,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 514 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:31:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-01-10 02:31:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 465. [2022-01-10 02:31:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-01-10 02:31:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 635 transitions. [2022-01-10 02:31:25,765 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 635 transitions. Word has length 57 [2022-01-10 02:31:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:25,765 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 635 transitions. [2022-01-10 02:31:25,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 635 transitions. [2022-01-10 02:31:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:25,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:25,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:25,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:31:25,768 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:25,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:25,768 INFO L85 PathProgramCache]: Analyzing trace with hash -428284406, now seen corresponding path program 1 times [2022-01-10 02:31:25,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:25,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102074681] [2022-01-10 02:31:25,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:25,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:25,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:25,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102074681] [2022-01-10 02:31:25,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102074681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:25,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:25,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:31:25,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810613321] [2022-01-10 02:31:25,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:25,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:31:25,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:25,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:31:25,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:31:25,841 INFO L87 Difference]: Start difference. First operand 465 states and 635 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:26,232 INFO L93 Difference]: Finished difference Result 689 states and 962 transitions. [2022-01-10 02:31:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:31:26,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:26,235 INFO L225 Difference]: With dead ends: 689 [2022-01-10 02:31:26,235 INFO L226 Difference]: Without dead ends: 596 [2022-01-10 02:31:26,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:31:26,236 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 434 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:26,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 660 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:31:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-01-10 02:31:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 555. [2022-01-10 02:31:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-01-10 02:31:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 763 transitions. [2022-01-10 02:31:26,255 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 763 transitions. Word has length 57 [2022-01-10 02:31:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:26,255 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 763 transitions. [2022-01-10 02:31:26,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 763 transitions. [2022-01-10 02:31:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:26,257 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:26,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:26,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:31:26,257 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:26,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1340236402, now seen corresponding path program 1 times [2022-01-10 02:31:26,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:26,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251820790] [2022-01-10 02:31:26,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:26,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:26,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:26,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251820790] [2022-01-10 02:31:26,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251820790] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:26,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:26,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:31:26,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051529348] [2022-01-10 02:31:26,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:26,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:31:26,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:26,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:31:26,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:26,328 INFO L87 Difference]: Start difference. First operand 555 states and 763 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:26,828 INFO L93 Difference]: Finished difference Result 887 states and 1237 transitions. [2022-01-10 02:31:26,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:31:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:26,831 INFO L225 Difference]: With dead ends: 887 [2022-01-10 02:31:26,831 INFO L226 Difference]: Without dead ends: 704 [2022-01-10 02:31:26,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:31:26,832 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 424 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:26,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 984 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:31:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-01-10 02:31:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 640. [2022-01-10 02:31:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-01-10 02:31:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 880 transitions. [2022-01-10 02:31:26,851 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 880 transitions. Word has length 57 [2022-01-10 02:31:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:26,851 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 880 transitions. [2022-01-10 02:31:26,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 880 transitions. [2022-01-10 02:31:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:26,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:26,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:26,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:31:26,853 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:26,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash 905343052, now seen corresponding path program 1 times [2022-01-10 02:31:26,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:26,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054258432] [2022-01-10 02:31:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:26,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:26,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:26,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054258432] [2022-01-10 02:31:26,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054258432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:26,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:26,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:31:26,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921975241] [2022-01-10 02:31:26,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:26,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:31:26,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:26,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:31:26,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:26,903 INFO L87 Difference]: Start difference. First operand 640 states and 880 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:27,466 INFO L93 Difference]: Finished difference Result 1198 states and 1670 transitions. [2022-01-10 02:31:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:31:27,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:27,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:27,470 INFO L225 Difference]: With dead ends: 1198 [2022-01-10 02:31:27,470 INFO L226 Difference]: Without dead ends: 930 [2022-01-10 02:31:27,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:31:27,471 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 435 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:27,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 959 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:31:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-01-10 02:31:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 798. [2022-01-10 02:31:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-01-10 02:31:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2022-01-10 02:31:27,495 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 57 [2022-01-10 02:31:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:27,495 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2022-01-10 02:31:27,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2022-01-10 02:31:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:27,496 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:27,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:27,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:31:27,497 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:27,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1153489546, now seen corresponding path program 1 times [2022-01-10 02:31:27,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:27,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756302760] [2022-01-10 02:31:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:27,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:27,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:27,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:27,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756302760] [2022-01-10 02:31:27,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756302760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:27,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:27,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:31:27,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176106032] [2022-01-10 02:31:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:27,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:31:27,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:31:27,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:27,581 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:28,030 INFO L93 Difference]: Finished difference Result 1381 states and 1951 transitions. [2022-01-10 02:31:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:31:28,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:28,033 INFO L225 Difference]: With dead ends: 1381 [2022-01-10 02:31:28,033 INFO L226 Difference]: Without dead ends: 956 [2022-01-10 02:31:28,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:31:28,035 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 224 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:28,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 852 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:31:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2022-01-10 02:31:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 813. [2022-01-10 02:31:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-01-10 02:31:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1116 transitions. [2022-01-10 02:31:28,060 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1116 transitions. Word has length 57 [2022-01-10 02:31:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:28,060 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 1116 transitions. [2022-01-10 02:31:28,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1116 transitions. [2022-01-10 02:31:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:28,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:28,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:28,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:31:28,061 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1081102988, now seen corresponding path program 1 times [2022-01-10 02:31:28,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:28,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683197422] [2022-01-10 02:31:28,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:28,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:28,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:28,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683197422] [2022-01-10 02:31:28,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683197422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:28,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:28,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:31:28,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771517584] [2022-01-10 02:31:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:28,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:31:28,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:31:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:31:28,107 INFO L87 Difference]: Start difference. First operand 813 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:28,606 INFO L93 Difference]: Finished difference Result 1803 states and 2499 transitions. [2022-01-10 02:31:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:31:28,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:28,612 INFO L225 Difference]: With dead ends: 1803 [2022-01-10 02:31:28,612 INFO L226 Difference]: Without dead ends: 1363 [2022-01-10 02:31:28,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:31:28,614 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 563 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:28,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 775 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:31:28,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2022-01-10 02:31:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1204. [2022-01-10 02:31:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-01-10 02:31:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1644 transitions. [2022-01-10 02:31:28,651 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1644 transitions. Word has length 57 [2022-01-10 02:31:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:28,651 INFO L470 AbstractCegarLoop]: Abstraction has 1204 states and 1644 transitions. [2022-01-10 02:31:28,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1644 transitions. [2022-01-10 02:31:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:28,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:28,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:28,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:31:28,653 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -690367987, now seen corresponding path program 1 times [2022-01-10 02:31:28,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:28,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968878715] [2022-01-10 02:31:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:28,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:28,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968878715] [2022-01-10 02:31:28,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968878715] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:28,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:28,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:31:28,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171665384] [2022-01-10 02:31:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:28,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:31:28,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:31:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:28,727 INFO L87 Difference]: Start difference. First operand 1204 states and 1644 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:29,092 INFO L93 Difference]: Finished difference Result 2242 states and 3103 transitions. [2022-01-10 02:31:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 02:31:29,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:29,097 INFO L225 Difference]: With dead ends: 2242 [2022-01-10 02:31:29,097 INFO L226 Difference]: Without dead ends: 1411 [2022-01-10 02:31:29,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:31:29,099 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 190 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:29,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 846 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:31:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-01-10 02:31:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1219. [2022-01-10 02:31:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-01-10 02:31:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1654 transitions. [2022-01-10 02:31:29,168 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1654 transitions. Word has length 57 [2022-01-10 02:31:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:29,168 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 1654 transitions. [2022-01-10 02:31:29,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1654 transitions. [2022-01-10 02:31:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:29,169 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:29,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:29,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 02:31:29,170 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:29,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:29,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1232860047, now seen corresponding path program 1 times [2022-01-10 02:31:29,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:29,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301069661] [2022-01-10 02:31:29,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:29,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:29,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:29,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301069661] [2022-01-10 02:31:29,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301069661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:29,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:29,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:31:29,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679119124] [2022-01-10 02:31:29,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:29,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:31:29,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:29,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:31:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:31:29,243 INFO L87 Difference]: Start difference. First operand 1219 states and 1654 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:29,675 INFO L93 Difference]: Finished difference Result 1767 states and 2397 transitions. [2022-01-10 02:31:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:31:29,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:29,679 INFO L225 Difference]: With dead ends: 1767 [2022-01-10 02:31:29,679 INFO L226 Difference]: Without dead ends: 1237 [2022-01-10 02:31:29,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:31:29,681 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 487 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:29,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 881 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:31:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2022-01-10 02:31:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1051. [2022-01-10 02:31:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2022-01-10 02:31:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1411 transitions. [2022-01-10 02:31:29,713 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1411 transitions. Word has length 57 [2022-01-10 02:31:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:29,713 INFO L470 AbstractCegarLoop]: Abstraction has 1051 states and 1411 transitions. [2022-01-10 02:31:29,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1411 transitions. [2022-01-10 02:31:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:29,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:29,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:29,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 02:31:29,715 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1451714765, now seen corresponding path program 1 times [2022-01-10 02:31:29,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:29,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389042775] [2022-01-10 02:31:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:29,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:29,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:29,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389042775] [2022-01-10 02:31:29,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389042775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:29,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:29,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:31:29,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115084745] [2022-01-10 02:31:29,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:29,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:31:29,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:29,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:31:29,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:31:29,765 INFO L87 Difference]: Start difference. First operand 1051 states and 1411 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:30,289 INFO L93 Difference]: Finished difference Result 2334 states and 3104 transitions. [2022-01-10 02:31:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 02:31:30,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:30,304 INFO L225 Difference]: With dead ends: 2334 [2022-01-10 02:31:30,304 INFO L226 Difference]: Without dead ends: 1657 [2022-01-10 02:31:30,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-01-10 02:31:30,306 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 493 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:30,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [504 Valid, 890 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:31:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-01-10 02:31:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1365. [2022-01-10 02:31:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2022-01-10 02:31:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1819 transitions. [2022-01-10 02:31:30,400 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1819 transitions. Word has length 57 [2022-01-10 02:31:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:30,400 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 1819 transitions. [2022-01-10 02:31:30,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1819 transitions. [2022-01-10 02:31:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:30,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:30,401 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:30,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:31:30,401 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:30,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1874416591, now seen corresponding path program 1 times [2022-01-10 02:31:30,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:30,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797647394] [2022-01-10 02:31:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:30,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:30,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:30,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:30,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:30,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:30,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:30,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797647394] [2022-01-10 02:31:30,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797647394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:30,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:30,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:31:30,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880967412] [2022-01-10 02:31:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:30,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:31:30,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:30,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:31:30,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:31:30,469 INFO L87 Difference]: Start difference. First operand 1365 states and 1819 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:30,950 INFO L93 Difference]: Finished difference Result 2334 states and 3094 transitions. [2022-01-10 02:31:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 02:31:30,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 02:31:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:30,955 INFO L225 Difference]: With dead ends: 2334 [2022-01-10 02:31:30,956 INFO L226 Difference]: Without dead ends: 1633 [2022-01-10 02:31:30,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-01-10 02:31:30,957 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 479 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:30,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 877 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:31:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-01-10 02:31:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1355. [2022-01-10 02:31:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2022-01-10 02:31:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1797 transitions. [2022-01-10 02:31:31,079 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1797 transitions. Word has length 57 [2022-01-10 02:31:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:31,079 INFO L470 AbstractCegarLoop]: Abstraction has 1355 states and 1797 transitions. [2022-01-10 02:31:31,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:31:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1797 transitions. [2022-01-10 02:31:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:31:31,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:31,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:31,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:31:31,081 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:31,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:31,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1056768141, now seen corresponding path program 1 times [2022-01-10 02:31:31,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:31,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021436508] [2022-01-10 02:31:31,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:31,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:31,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:31,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021436508] [2022-01-10 02:31:31,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021436508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:31,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:31,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:31:31,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082528224] [2022-01-10 02:31:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:31,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:31:31,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:31:31,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:31:31,124 INFO L87 Difference]: Start difference. First operand 1355 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 02:31:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:31,395 INFO L93 Difference]: Finished difference Result 2962 states and 3933 transitions. [2022-01-10 02:31:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:31:31,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-01-10 02:31:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:31,401 INFO L225 Difference]: With dead ends: 2962 [2022-01-10 02:31:31,401 INFO L226 Difference]: Without dead ends: 1977 [2022-01-10 02:31:31,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:31:31,403 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 443 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:31,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 499 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:31:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2022-01-10 02:31:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1759. [2022-01-10 02:31:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2022-01-10 02:31:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2301 transitions. [2022-01-10 02:31:31,462 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2301 transitions. Word has length 57 [2022-01-10 02:31:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:31,462 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2301 transitions. [2022-01-10 02:31:31,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 02:31:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2301 transitions. [2022-01-10 02:31:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 02:31:31,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:31,464 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:31,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:31:31,464 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2041766118, now seen corresponding path program 1 times [2022-01-10 02:31:31,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:31,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202122789] [2022-01-10 02:31:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:31,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:31:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-10 02:31:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 02:31:31,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:31,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202122789] [2022-01-10 02:31:31,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202122789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:31,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:31,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:31:31,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823647684] [2022-01-10 02:31:31,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:31,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:31:31,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:31:31,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:31:31,489 INFO L87 Difference]: Start difference. First operand 1759 states and 2301 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 02:31:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:31,681 INFO L93 Difference]: Finished difference Result 2343 states and 3086 transitions. [2022-01-10 02:31:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:31:31,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-01-10 02:31:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:31,688 INFO L225 Difference]: With dead ends: 2343 [2022-01-10 02:31:31,688 INFO L226 Difference]: Without dead ends: 1987 [2022-01-10 02:31:31,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:31:31,689 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 132 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:31,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 620 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:31:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2022-01-10 02:31:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1949. [2022-01-10 02:31:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2022-01-10 02:31:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2539 transitions. [2022-01-10 02:31:31,768 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2539 transitions. Word has length 62 [2022-01-10 02:31:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:31,769 INFO L470 AbstractCegarLoop]: Abstraction has 1949 states and 2539 transitions. [2022-01-10 02:31:31,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 02:31:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2539 transitions. [2022-01-10 02:31:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 02:31:31,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:31,770 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:31,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 02:31:31,770 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:31,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2064164623, now seen corresponding path program 1 times [2022-01-10 02:31:31,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:31,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585542180] [2022-01-10 02:31:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:31,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:31:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 02:31:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 02:31:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 02:31:31,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:31,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585542180] [2022-01-10 02:31:31,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585542180] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:31,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:31,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:31:31,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450922254] [2022-01-10 02:31:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:31,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:31:31,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:31,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:31:31,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:31:31,795 INFO L87 Difference]: Start difference. First operand 1949 states and 2539 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 02:31:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:31,942 INFO L93 Difference]: Finished difference Result 2602 states and 3392 transitions. [2022-01-10 02:31:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:31:31,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-01-10 02:31:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:31,948 INFO L225 Difference]: With dead ends: 2602 [2022-01-10 02:31:31,948 INFO L226 Difference]: Without dead ends: 2148 [2022-01-10 02:31:31,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:31:31,949 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 279 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:31,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 457 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:31:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-01-10 02:31:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2093. [2022-01-10 02:31:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-01-10 02:31:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2712 transitions. [2022-01-10 02:31:32,016 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2712 transitions. Word has length 67 [2022-01-10 02:31:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:32,016 INFO L470 AbstractCegarLoop]: Abstraction has 2093 states and 2712 transitions. [2022-01-10 02:31:32,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 02:31:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2712 transitions. [2022-01-10 02:31:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 02:31:32,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:32,018 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:32,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:31:32,018 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1473250423, now seen corresponding path program 1 times [2022-01-10 02:31:32,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:32,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190850526] [2022-01-10 02:31:32,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:32,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:31:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:31:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:31:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 02:31:32,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:32,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190850526] [2022-01-10 02:31:32,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190850526] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:31:32,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632450793] [2022-01-10 02:31:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:32,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:32,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:31:32,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:31:32,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 02:31:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:31:32,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:31:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:32,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:31:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 02:31:32,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632450793] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 02:31:32,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:31:32,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-01-10 02:31:32,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691421229] [2022-01-10 02:31:32,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:32,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:31:32,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:32,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:31:32,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:31:32,400 INFO L87 Difference]: Start difference. First operand 2093 states and 2712 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 02:31:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:32,532 INFO L93 Difference]: Finished difference Result 2149 states and 2780 transitions. [2022-01-10 02:31:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:31:32,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-01-10 02:31:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:32,538 INFO L225 Difference]: With dead ends: 2149 [2022-01-10 02:31:32,539 INFO L226 Difference]: Without dead ends: 2146 [2022-01-10 02:31:32,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:31:32,540 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 399 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:32,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 328 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:31:32,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2022-01-10 02:31:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2092. [2022-01-10 02:31:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-01-10 02:31:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2709 transitions. [2022-01-10 02:31:32,620 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2709 transitions. Word has length 68 [2022-01-10 02:31:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:32,620 INFO L470 AbstractCegarLoop]: Abstraction has 2092 states and 2709 transitions. [2022-01-10 02:31:32,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 02:31:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2709 transitions. [2022-01-10 02:31:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 02:31:32,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:32,622 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:32,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:31:32,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-10 02:31:32,838 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:32,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1574463180, now seen corresponding path program 1 times [2022-01-10 02:31:32,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:32,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419160799] [2022-01-10 02:31:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:32,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:31:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:31:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:31:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 02:31:32,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:32,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419160799] [2022-01-10 02:31:32,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419160799] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:31:32,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687742561] [2022-01-10 02:31:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:32,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:32,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:31:32,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:31:32,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 02:31:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:32,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:31:32,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:31:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:31:33,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:31:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 02:31:33,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687742561] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:31:33,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:31:33,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-01-10 02:31:33,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793392756] [2022-01-10 02:31:33,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:31:33,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 02:31:33,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 02:31:33,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:31:33,369 INFO L87 Difference]: Start difference. First operand 2092 states and 2709 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-01-10 02:31:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:34,209 INFO L93 Difference]: Finished difference Result 3792 states and 4929 transitions. [2022-01-10 02:31:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-10 02:31:34,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-01-10 02:31:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:34,220 INFO L225 Difference]: With dead ends: 3792 [2022-01-10 02:31:34,220 INFO L226 Difference]: Without dead ends: 3248 [2022-01-10 02:31:34,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-01-10 02:31:34,223 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 636 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:34,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [658 Valid, 2241 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:31:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2022-01-10 02:31:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2481. [2022-01-10 02:31:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2022-01-10 02:31:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3197 transitions. [2022-01-10 02:31:34,337 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3197 transitions. Word has length 69 [2022-01-10 02:31:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:34,337 INFO L470 AbstractCegarLoop]: Abstraction has 2481 states and 3197 transitions. [2022-01-10 02:31:34,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-01-10 02:31:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3197 transitions. [2022-01-10 02:31:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 02:31:34,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:34,341 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:34,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 02:31:34,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-10 02:31:34,560 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:34,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1815627380, now seen corresponding path program 1 times [2022-01-10 02:31:34,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:34,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59945042] [2022-01-10 02:31:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:34,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:31:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:31:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 02:31:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 02:31:34,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:34,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59945042] [2022-01-10 02:31:34,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59945042] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:31:34,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558882251] [2022-01-10 02:31:34,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:34,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:34,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:31:34,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:31:34,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 02:31:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:34,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:31:34,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:31:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 02:31:34,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:31:34,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558882251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:34,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:31:34,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-01-10 02:31:34,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428336861] [2022-01-10 02:31:34,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:34,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:31:34,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:34,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:31:34,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:34,881 INFO L87 Difference]: Start difference. First operand 2481 states and 3197 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 02:31:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:35,000 INFO L93 Difference]: Finished difference Result 3204 states and 4135 transitions. [2022-01-10 02:31:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:31:35,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-01-10 02:31:35,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:35,011 INFO L225 Difference]: With dead ends: 3204 [2022-01-10 02:31:35,012 INFO L226 Difference]: Without dead ends: 2359 [2022-01-10 02:31:35,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:35,016 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 196 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:35,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 342 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:31:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2022-01-10 02:31:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2344. [2022-01-10 02:31:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2022-01-10 02:31:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3017 transitions. [2022-01-10 02:31:35,156 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3017 transitions. Word has length 88 [2022-01-10 02:31:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:35,156 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 3017 transitions. [2022-01-10 02:31:35,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 02:31:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3017 transitions. [2022-01-10 02:31:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 02:31:35,158 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:35,158 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:35,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 02:31:35,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:35,376 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:35,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1196332864, now seen corresponding path program 1 times [2022-01-10 02:31:35,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:35,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12557142] [2022-01-10 02:31:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:35,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:35,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:35,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:35,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:35,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 02:31:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:31:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 02:31:35,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:35,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12557142] [2022-01-10 02:31:35,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12557142] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:35,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:35,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:31:35,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120904353] [2022-01-10 02:31:35,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:35,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:31:35,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:35,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:31:35,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:35,481 INFO L87 Difference]: Start difference. First operand 2344 states and 3017 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:31:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:35,984 INFO L93 Difference]: Finished difference Result 5463 states and 7157 transitions. [2022-01-10 02:31:35,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:31:35,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-01-10 02:31:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:36,012 INFO L225 Difference]: With dead ends: 5463 [2022-01-10 02:31:36,012 INFO L226 Difference]: Without dead ends: 4080 [2022-01-10 02:31:36,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-01-10 02:31:36,016 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 784 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:36,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [796 Valid, 504 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:31:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2022-01-10 02:31:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3682. [2022-01-10 02:31:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2022-01-10 02:31:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4767 transitions. [2022-01-10 02:31:36,166 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4767 transitions. Word has length 92 [2022-01-10 02:31:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:36,167 INFO L470 AbstractCegarLoop]: Abstraction has 3682 states and 4767 transitions. [2022-01-10 02:31:36,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:31:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4767 transitions. [2022-01-10 02:31:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 02:31:36,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:36,170 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:36,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 02:31:36,170 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash 128523330, now seen corresponding path program 1 times [2022-01-10 02:31:36,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:36,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832952755] [2022-01-10 02:31:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:36,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 02:31:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:31:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 02:31:36,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:36,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832952755] [2022-01-10 02:31:36,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832952755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:36,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:36,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:31:36,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834004233] [2022-01-10 02:31:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:36,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:31:36,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:36,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:31:36,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:31:36,213 INFO L87 Difference]: Start difference. First operand 3682 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:31:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:36,531 INFO L93 Difference]: Finished difference Result 6081 states and 7883 transitions. [2022-01-10 02:31:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:31:36,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2022-01-10 02:31:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:36,548 INFO L225 Difference]: With dead ends: 6081 [2022-01-10 02:31:36,548 INFO L226 Difference]: Without dead ends: 3360 [2022-01-10 02:31:36,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:31:36,554 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 301 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:36,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 476 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:31:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-01-10 02:31:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3048. [2022-01-10 02:31:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2528 states have (on average 1.2796677215189873) internal successors, (3235), 2579 states have internal predecessors, (3235), 292 states have call successors, (292), 188 states have call predecessors, (292), 226 states have return successors, (402), 282 states have call predecessors, (402), 291 states have call successors, (402) [2022-01-10 02:31:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3929 transitions. [2022-01-10 02:31:36,681 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 3929 transitions. Word has length 92 [2022-01-10 02:31:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:36,681 INFO L470 AbstractCegarLoop]: Abstraction has 3048 states and 3929 transitions. [2022-01-10 02:31:36,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:31:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3929 transitions. [2022-01-10 02:31:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 02:31:36,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:36,684 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:36,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 02:31:36,685 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:36,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash 172011463, now seen corresponding path program 1 times [2022-01-10 02:31:36,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:36,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033728565] [2022-01-10 02:31:36,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:36,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 02:31:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 02:31:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:31:36,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:36,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033728565] [2022-01-10 02:31:36,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033728565] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:36,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:36,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:31:36,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505260869] [2022-01-10 02:31:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:36,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:31:36,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:31:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:36,741 INFO L87 Difference]: Start difference. First operand 3048 states and 3929 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:31:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:37,665 INFO L93 Difference]: Finished difference Result 6551 states and 8590 transitions. [2022-01-10 02:31:37,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 02:31:37,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2022-01-10 02:31:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:37,676 INFO L225 Difference]: With dead ends: 6551 [2022-01-10 02:31:37,676 INFO L226 Difference]: Without dead ends: 4464 [2022-01-10 02:31:37,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-01-10 02:31:37,681 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 1168 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:37,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1182 Valid, 816 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:31:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4464 states. [2022-01-10 02:31:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4464 to 4168. [2022-01-10 02:31:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 3452 states have (on average 1.2604287369640788) internal successors, (4351), 3527 states have internal predecessors, (4351), 387 states have call successors, (387), 259 states have call predecessors, (387), 327 states have return successors, (558), 383 states have call predecessors, (558), 386 states have call successors, (558) [2022-01-10 02:31:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5296 transitions. [2022-01-10 02:31:37,899 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5296 transitions. Word has length 93 [2022-01-10 02:31:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:37,899 INFO L470 AbstractCegarLoop]: Abstraction has 4168 states and 5296 transitions. [2022-01-10 02:31:37,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:31:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5296 transitions. [2022-01-10 02:31:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 02:31:37,902 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:37,902 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:37,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 02:31:37,902 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:37,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:37,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1890951514, now seen corresponding path program 1 times [2022-01-10 02:31:37,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:37,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096532137] [2022-01-10 02:31:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:37,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:37,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:31:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:31:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-10 02:31:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 02:31:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 02:31:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 02:31:37,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096532137] [2022-01-10 02:31:37,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096532137] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:31:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917976536] [2022-01-10 02:31:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:37,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:37,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:31:37,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:31:37,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 02:31:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:38,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:31:38,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:31:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:31:38,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:31:38,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917976536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:38,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:31:38,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-01-10 02:31:38,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626929112] [2022-01-10 02:31:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:38,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:31:38,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:31:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:38,178 INFO L87 Difference]: Start difference. First operand 4168 states and 5296 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 02:31:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:38,467 INFO L93 Difference]: Finished difference Result 4547 states and 5764 transitions. [2022-01-10 02:31:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:31:38,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-01-10 02:31:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:38,496 INFO L225 Difference]: With dead ends: 4547 [2022-01-10 02:31:38,496 INFO L226 Difference]: Without dead ends: 3221 [2022-01-10 02:31:38,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:38,499 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 62 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:38,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 490 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:31:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2022-01-10 02:31:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3221. [2022-01-10 02:31:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 2608 states have (on average 1.2626533742331287) internal successors, (3293), 2667 states have internal predecessors, (3293), 330 states have call successors, (330), 222 states have call predecessors, (330), 282 states have return successors, (466), 333 states have call predecessors, (466), 330 states have call successors, (466) [2022-01-10 02:31:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4089 transitions. [2022-01-10 02:31:38,758 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4089 transitions. Word has length 103 [2022-01-10 02:31:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:38,759 INFO L470 AbstractCegarLoop]: Abstraction has 3221 states and 4089 transitions. [2022-01-10 02:31:38,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 02:31:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4089 transitions. [2022-01-10 02:31:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-10 02:31:38,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:38,762 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:38,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 02:31:38,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:38,978 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 199854852, now seen corresponding path program 1 times [2022-01-10 02:31:38,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:38,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375170038] [2022-01-10 02:31:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:38,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 02:31:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:31:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:31:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 02:31:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-01-10 02:31:39,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:39,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375170038] [2022-01-10 02:31:39,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375170038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:39,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:39,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:31:39,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887365492] [2022-01-10 02:31:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:39,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:31:39,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:31:39,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:31:39,043 INFO L87 Difference]: Start difference. First operand 3221 states and 4089 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 02:31:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:39,823 INFO L93 Difference]: Finished difference Result 7795 states and 10213 transitions. [2022-01-10 02:31:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 02:31:39,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 135 [2022-01-10 02:31:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:39,836 INFO L225 Difference]: With dead ends: 7795 [2022-01-10 02:31:39,836 INFO L226 Difference]: Without dead ends: 4713 [2022-01-10 02:31:39,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-01-10 02:31:39,842 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 758 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:39,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 417 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:31:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4713 states. [2022-01-10 02:31:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4713 to 4229. [2022-01-10 02:31:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4229 states, 3447 states have (on average 1.2236727589208007) internal successors, (4218), 3552 states have internal predecessors, (4218), 393 states have call successors, (393), 285 states have call predecessors, (393), 388 states have return successors, (591), 393 states have call predecessors, (591), 393 states have call successors, (591) [2022-01-10 02:31:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4229 states to 4229 states and 5202 transitions. [2022-01-10 02:31:40,047 INFO L78 Accepts]: Start accepts. Automaton has 4229 states and 5202 transitions. Word has length 135 [2022-01-10 02:31:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:40,048 INFO L470 AbstractCegarLoop]: Abstraction has 4229 states and 5202 transitions. [2022-01-10 02:31:40,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 02:31:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4229 states and 5202 transitions. [2022-01-10 02:31:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-10 02:31:40,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:40,052 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:40,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 02:31:40,052 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash -242597663, now seen corresponding path program 2 times [2022-01-10 02:31:40,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:40,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710329834] [2022-01-10 02:31:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:40,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 02:31:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:31:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:31:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 02:31:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 02:31:40,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:40,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710329834] [2022-01-10 02:31:40,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710329834] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:31:40,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620836187] [2022-01-10 02:31:40,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:31:40,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:40,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:31:40,126 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:31:40,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 02:31:40,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:31:40,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:31:40,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:31:40,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:31:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 02:31:40,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:31:40,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620836187] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:40,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:31:40,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-01-10 02:31:40,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560603020] [2022-01-10 02:31:40,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:40,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:31:40,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:31:40,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:31:40,436 INFO L87 Difference]: Start difference. First operand 4229 states and 5202 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 02:31:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:40,772 INFO L93 Difference]: Finished difference Result 7017 states and 8818 transitions. [2022-01-10 02:31:40,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:31:40,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-01-10 02:31:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:40,780 INFO L225 Difference]: With dead ends: 7017 [2022-01-10 02:31:40,780 INFO L226 Difference]: Without dead ends: 4105 [2022-01-10 02:31:40,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:31:40,785 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 78 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:40,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:31:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2022-01-10 02:31:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4079. [2022-01-10 02:31:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4079 states, 3297 states have (on average 1.2095844707309675) internal successors, (3988), 3402 states have internal predecessors, (3988), 393 states have call successors, (393), 285 states have call predecessors, (393), 388 states have return successors, (591), 393 states have call predecessors, (591), 393 states have call successors, (591) [2022-01-10 02:31:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 4972 transitions. [2022-01-10 02:31:41,168 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 4972 transitions. Word has length 135 [2022-01-10 02:31:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:41,168 INFO L470 AbstractCegarLoop]: Abstraction has 4079 states and 4972 transitions. [2022-01-10 02:31:41,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 02:31:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 4972 transitions. [2022-01-10 02:31:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-01-10 02:31:41,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:41,172 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:41,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 02:31:41,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-01-10 02:31:41,387 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash 652625369, now seen corresponding path program 1 times [2022-01-10 02:31:41,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:41,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653454897] [2022-01-10 02:31:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:41,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 02:31:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:31:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:31:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-01-10 02:31:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-10 02:31:41,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:41,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653454897] [2022-01-10 02:31:41,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653454897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:41,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:41,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:31:41,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079876110] [2022-01-10 02:31:41,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:41,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:31:41,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:31:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:31:41,491 INFO L87 Difference]: Start difference. First operand 4079 states and 4972 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 02:31:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:42,247 INFO L93 Difference]: Finished difference Result 11890 states and 14610 transitions. [2022-01-10 02:31:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 02:31:42,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2022-01-10 02:31:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:42,269 INFO L225 Difference]: With dead ends: 11890 [2022-01-10 02:31:42,269 INFO L226 Difference]: Without dead ends: 8818 [2022-01-10 02:31:42,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-01-10 02:31:42,278 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 541 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:42,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 506 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:31:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8818 states. [2022-01-10 02:31:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8818 to 7140. [2022-01-10 02:31:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7140 states, 5815 states have (on average 1.2257953568357696) internal successors, (7128), 5993 states have internal predecessors, (7128), 662 states have call successors, (662), 483 states have call predecessors, (662), 662 states have return successors, (1008), 665 states have call predecessors, (1008), 662 states have call successors, (1008) [2022-01-10 02:31:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7140 states to 7140 states and 8798 transitions. [2022-01-10 02:31:42,734 INFO L78 Accepts]: Start accepts. Automaton has 7140 states and 8798 transitions. Word has length 136 [2022-01-10 02:31:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:42,734 INFO L470 AbstractCegarLoop]: Abstraction has 7140 states and 8798 transitions. [2022-01-10 02:31:42,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 02:31:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 7140 states and 8798 transitions. [2022-01-10 02:31:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 02:31:42,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:42,740 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:42,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 02:31:42,740 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:42,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1255313462, now seen corresponding path program 1 times [2022-01-10 02:31:42,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:42,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574778927] [2022-01-10 02:31:42,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:42,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 02:31:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 02:31:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-10 02:31:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-10 02:31:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 02:31:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 02:31:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-01-10 02:31:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:31:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 02:31:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-01-10 02:31:42,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:42,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574778927] [2022-01-10 02:31:42,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574778927] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:31:42,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270375424] [2022-01-10 02:31:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:42,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:42,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:31:42,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:31:42,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 02:31:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:42,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:31:42,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:31:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 02:31:43,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:31:43,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270375424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:43,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:31:43,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-01-10 02:31:43,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383172906] [2022-01-10 02:31:43,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:43,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:31:43,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:43,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:31:43,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:31:43,085 INFO L87 Difference]: Start difference. First operand 7140 states and 8798 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-10 02:31:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:43,293 INFO L93 Difference]: Finished difference Result 10848 states and 13407 transitions. [2022-01-10 02:31:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:31:43,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2022-01-10 02:31:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:43,303 INFO L225 Difference]: With dead ends: 10848 [2022-01-10 02:31:43,303 INFO L226 Difference]: Without dead ends: 3722 [2022-01-10 02:31:43,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-10 02:31:43,312 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 31 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:43,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 684 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:31:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2022-01-10 02:31:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3450. [2022-01-10 02:31:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2842 states have (on average 1.2149894440534834) internal successors, (3453), 2891 states have internal predecessors, (3453), 308 states have call successors, (308), 213 states have call predecessors, (308), 299 states have return successors, (471), 345 states have call predecessors, (471), 308 states have call successors, (471) [2022-01-10 02:31:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4232 transitions. [2022-01-10 02:31:43,475 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4232 transitions. Word has length 159 [2022-01-10 02:31:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:43,475 INFO L470 AbstractCegarLoop]: Abstraction has 3450 states and 4232 transitions. [2022-01-10 02:31:43,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-10 02:31:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4232 transitions. [2022-01-10 02:31:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 02:31:43,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:43,478 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:43,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-10 02:31:43,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-10 02:31:43,692 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash -790442704, now seen corresponding path program 1 times [2022-01-10 02:31:43,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:43,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155893137] [2022-01-10 02:31:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:43,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 02:31:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 02:31:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-10 02:31:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-10 02:31:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-01-10 02:31:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-10 02:31:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 02:31:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-01-10 02:31:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-10 02:31:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-01-10 02:31:43,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:43,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155893137] [2022-01-10 02:31:43,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155893137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:43,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:31:43,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:31:43,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443334203] [2022-01-10 02:31:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:43,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:31:43,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:43,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:31:43,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:31:43,758 INFO L87 Difference]: Start difference. First operand 3450 states and 4232 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-01-10 02:31:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:44,280 INFO L93 Difference]: Finished difference Result 6175 states and 7543 transitions. [2022-01-10 02:31:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:31:44,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 163 [2022-01-10 02:31:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:44,286 INFO L225 Difference]: With dead ends: 6175 [2022-01-10 02:31:44,286 INFO L226 Difference]: Without dead ends: 2985 [2022-01-10 02:31:44,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:31:44,291 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 613 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:44,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [622 Valid, 333 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:31:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2022-01-10 02:31:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2701. [2022-01-10 02:31:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2262 states have (on average 1.1923076923076923) internal successors, (2697), 2275 states have internal predecessors, (2697), 231 states have call successors, (231), 164 states have call predecessors, (231), 207 states have return successors, (314), 261 states have call predecessors, (314), 231 states have call successors, (314) [2022-01-10 02:31:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3242 transitions. [2022-01-10 02:31:44,497 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3242 transitions. Word has length 163 [2022-01-10 02:31:44,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:44,498 INFO L470 AbstractCegarLoop]: Abstraction has 2701 states and 3242 transitions. [2022-01-10 02:31:44,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-01-10 02:31:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3242 transitions. [2022-01-10 02:31:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 02:31:44,500 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:44,500 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:44,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 02:31:44,500 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:44,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1045972563, now seen corresponding path program 1 times [2022-01-10 02:31:44,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:44,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772109165] [2022-01-10 02:31:44,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:44,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 02:31:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 02:31:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-10 02:31:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-10 02:31:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-01-10 02:31:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:31:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-10 02:31:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-01-10 02:31:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-01-10 02:31:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-10 02:31:44,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:44,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772109165] [2022-01-10 02:31:44,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772109165] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:31:44,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902570599] [2022-01-10 02:31:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:44,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:31:44,596 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:31:44,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 02:31:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:44,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 02:31:44,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:31:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-01-10 02:31:44,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:31:44,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902570599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:44,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:31:44,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2022-01-10 02:31:44,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141371347] [2022-01-10 02:31:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:44,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:31:44,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:31:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:31:44,999 INFO L87 Difference]: Start difference. First operand 2701 states and 3242 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-10 02:31:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:45,155 INFO L93 Difference]: Finished difference Result 4595 states and 5560 transitions. [2022-01-10 02:31:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:31:45,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-01-10 02:31:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:45,159 INFO L225 Difference]: With dead ends: 4595 [2022-01-10 02:31:45,159 INFO L226 Difference]: Without dead ends: 2020 [2022-01-10 02:31:45,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:31:45,163 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 106 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:45,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 178 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:31:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2022-01-10 02:31:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1549. [2022-01-10 02:31:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1294 states have (on average 1.1452859350850078) internal successors, (1482), 1308 states have internal predecessors, (1482), 124 states have call successors, (124), 104 states have call predecessors, (124), 130 states have return successors, (168), 136 states have call predecessors, (168), 124 states have call successors, (168) [2022-01-10 02:31:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1774 transitions. [2022-01-10 02:31:45,247 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1774 transitions. Word has length 164 [2022-01-10 02:31:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:45,247 INFO L470 AbstractCegarLoop]: Abstraction has 1549 states and 1774 transitions. [2022-01-10 02:31:45,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-10 02:31:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1774 transitions. [2022-01-10 02:31:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-01-10 02:31:45,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:31:45,249 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:31:45,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 02:31:45,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:45,463 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:31:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:31:45,463 INFO L85 PathProgramCache]: Analyzing trace with hash 239124213, now seen corresponding path program 1 times [2022-01-10 02:31:45,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:31:45,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714016449] [2022-01-10 02:31:45,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:45,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:31:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:31:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:31:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:31:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:31:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:31:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 02:31:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:31:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:31:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-01-10 02:31:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-01-10 02:31:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:31:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-10 02:31:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 67 proven. 14 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-01-10 02:31:45,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:31:45,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714016449] [2022-01-10 02:31:45,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714016449] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:31:45,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478818896] [2022-01-10 02:31:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:31:45,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:45,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:31:45,520 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:31:45,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 02:31:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:31:45,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:31:45,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:31:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-01-10 02:31:45,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:31:45,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478818896] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:31:45,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:31:45,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-01-10 02:31:45,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270231277] [2022-01-10 02:31:45,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:31:45,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:31:45,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:31:45,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:31:45,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:45,808 INFO L87 Difference]: Start difference. First operand 1549 states and 1774 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:31:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:31:45,849 INFO L93 Difference]: Finished difference Result 2085 states and 2411 transitions. [2022-01-10 02:31:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:31:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 175 [2022-01-10 02:31:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:31:45,850 INFO L225 Difference]: With dead ends: 2085 [2022-01-10 02:31:45,850 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 02:31:45,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:31:45,852 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 96 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:31:45,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 267 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:31:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 02:31:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 02:31:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:31:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 02:31:45,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2022-01-10 02:31:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:31:45,853 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 02:31:45,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:31:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 02:31:45,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 02:31:45,855 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 02:31:45,855 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 02:31:45,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 02:31:46,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:31:46,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 02:32:01,282 WARN L228 SmtUtils]: Spent 14.48s on a formula simplification. DAG size of input: 143 DAG size of output: 139 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-10 02:32:12,783 WARN L228 SmtUtils]: Spent 10.78s on a formula simplification. DAG size of input: 123 DAG size of output: 122 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-10 02:32:24,650 WARN L228 SmtUtils]: Spent 10.10s on a formula simplification. DAG size of input: 121 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)