./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81c7729345d5d6e6cfdedd64c331a4f8f6005773af2c566c0c24cc964b2ec390 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:06:50,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:06:50,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:06:50,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:06:50,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:06:50,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:06:50,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:06:50,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:06:50,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:06:50,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:06:50,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:06:50,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:06:50,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:06:50,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:06:50,869 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:06:50,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:06:50,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:06:50,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:06:50,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:06:50,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:06:50,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:06:50,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:06:50,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:06:50,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:06:50,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:06:50,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:06:50,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:06:50,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:06:50,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:06:50,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:06:50,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:06:50,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:06:50,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:06:50,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:06:50,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:06:50,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:06:50,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:06:50,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:06:50,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:06:50,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:06:50,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:06:50,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:06:50,880 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81c7729345d5d6e6cfdedd64c331a4f8f6005773af2c566c0c24cc964b2ec390 [2024-11-12 07:06:51,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:06:51,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:06:51,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:06:51,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:06:51,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:06:51,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2024-11-12 07:06:52,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:06:52,925 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:06:52,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2024-11-12 07:06:52,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f210b4682/45520ff299b34226b31c2ac02d989efa/FLAG85f5a9b15 [2024-11-12 07:06:53,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f210b4682/45520ff299b34226b31c2ac02d989efa [2024-11-12 07:06:53,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:06:53,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:06:53,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:06:53,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:06:53,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:06:53,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6fe84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53, skipping insertion in model container [2024-11-12 07:06:53,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:06:53,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i[916,929] [2024-11-12 07:06:53,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:06:53,614 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:06:53,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i[916,929] [2024-11-12 07:06:53,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:06:53,707 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:06:53,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53 WrapperNode [2024-11-12 07:06:53,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:06:53,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:06:53,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:06:53,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:06:53,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,778 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2024-11-12 07:06:53,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:06:53,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:06:53,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:06:53,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:06:53,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,826 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 8, 43, 27, 26, 18]. 35 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 3, 4, 2, 2]. The 15 writes are split as follows [0, 1, 4, 6, 2, 2]. [2024-11-12 07:06:53,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:06:53,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:06:53,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:06:53,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:06:53,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (1/1) ... [2024-11-12 07:06:53,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:06:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:06:53,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:06:53,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:06:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:06:53,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:06:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:06:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:06:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:06:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:06:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:06:53,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:06:53,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:06:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:06:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:06:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:06:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:06:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:06:53,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:06:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:06:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:06:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:06:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:06:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:06:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:06:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:06:53,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:06:54,137 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:06:54,142 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:06:54,756 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-12 07:06:54,757 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:06:54,770 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:06:54,770 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:06:54,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:06:54 BoogieIcfgContainer [2024-11-12 07:06:54,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:06:54,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:06:54,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:06:54,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:06:54,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:06:53" (1/3) ... [2024-11-12 07:06:54,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49615c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:06:54, skipping insertion in model container [2024-11-12 07:06:54,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:53" (2/3) ... [2024-11-12 07:06:54,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49615c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:06:54, skipping insertion in model container [2024-11-12 07:06:54,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:06:54" (3/3) ... [2024-11-12 07:06:54,783 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-19.i [2024-11-12 07:06:54,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:06:54,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:06:54,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:06:54,863 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@547fb081, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:06:54,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:06:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:06:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:06:54,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:54,879 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:06:54,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:54,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 864698559, now seen corresponding path program 1 times [2024-11-12 07:06:54,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:54,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558769618] [2024-11-12 07:06:54,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:54,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:06:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:06:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:06:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:06:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:06:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:06:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:06:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:55,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558769618] [2024-11-12 07:06:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558769618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:06:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428760252] [2024-11-12 07:06:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:55,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:06:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:55,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:06:55,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:06:55,349 INFO L87 Difference]: Start difference. First operand has 102 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:06:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:55,379 INFO L93 Difference]: Finished difference Result 197 states and 307 transitions. [2024-11-12 07:06:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:06:55,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2024-11-12 07:06:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:55,392 INFO L225 Difference]: With dead ends: 197 [2024-11-12 07:06:55,392 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 07:06:55,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:06:55,398 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:55,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:06:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 07:06:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 07:06:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:06:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2024-11-12 07:06:55,437 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 132 [2024-11-12 07:06:55,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:55,438 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2024-11-12 07:06:55,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:06:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2024-11-12 07:06:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:06:55,441 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:55,442 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:06:55,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:06:55,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:55,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:55,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1949528607, now seen corresponding path program 1 times [2024-11-12 07:06:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:55,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990745087] [2024-11-12 07:06:55,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:55,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:06:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:06:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:06:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:06:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:06:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:06:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:06:55,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:55,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990745087] [2024-11-12 07:06:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990745087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:55,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:06:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054464401] [2024-11-12 07:06:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:55,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:06:55,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:06:55,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:06:55,870 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:06:55,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:55,921 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2024-11-12 07:06:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:06:55,922 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-11-12 07:06:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:55,927 INFO L225 Difference]: With dead ends: 196 [2024-11-12 07:06:55,927 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 07:06:55,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:06:55,931 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:55,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 399 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:06:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 07:06:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-12 07:06:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:06:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2024-11-12 07:06:55,945 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 132 [2024-11-12 07:06:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:55,947 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2024-11-12 07:06:55,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:06:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2024-11-12 07:06:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:06:55,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:55,952 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:06:55,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:06:55,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:55,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1947681565, now seen corresponding path program 1 times [2024-11-12 07:06:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:55,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898987707] [2024-11-12 07:06:55,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:06:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:06:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:06:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:06:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:06:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:06:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:06:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:57,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898987707] [2024-11-12 07:06:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898987707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:57,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:57,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:06:57,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098424871] [2024-11-12 07:06:57,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:57,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:06:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:06:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:06:57,431 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:06:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:57,962 INFO L93 Difference]: Finished difference Result 272 states and 382 transitions. [2024-11-12 07:06:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:06:57,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-11-12 07:06:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:57,965 INFO L225 Difference]: With dead ends: 272 [2024-11-12 07:06:57,965 INFO L226 Difference]: Without dead ends: 175 [2024-11-12 07:06:57,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:06:57,970 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 89 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:57,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1078 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:06:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-12 07:06:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2024-11-12 07:06:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 139 states have (on average 1.2949640287769784) internal successors, (180), 140 states have internal predecessors, (180), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:06:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 240 transitions. [2024-11-12 07:06:58,009 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 240 transitions. Word has length 132 [2024-11-12 07:06:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:58,012 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 240 transitions. [2024-11-12 07:06:58,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:06:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 240 transitions. [2024-11-12 07:06:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:06:58,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:58,018 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:06:58,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:06:58,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:58,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash 758937829, now seen corresponding path program 1 times [2024-11-12 07:06:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:58,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330789266] [2024-11-12 07:06:58,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:06:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:06:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:06:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:06:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:06:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:06:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:06:58,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:58,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330789266] [2024-11-12 07:06:58,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330789266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:58,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:58,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:06:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467307836] [2024-11-12 07:06:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:58,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:06:58,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:58,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:06:58,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:06:58,527 INFO L87 Difference]: Start difference. First operand 172 states and 240 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:06:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:58,608 INFO L93 Difference]: Finished difference Result 383 states and 533 transitions. [2024-11-12 07:06:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:06:58,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2024-11-12 07:06:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:58,614 INFO L225 Difference]: With dead ends: 383 [2024-11-12 07:06:58,614 INFO L226 Difference]: Without dead ends: 214 [2024-11-12 07:06:58,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:06:58,616 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 94 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:58,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 658 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:06:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-12 07:06:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 178. [2024-11-12 07:06:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 145 states have (on average 1.296551724137931) internal successors, (188), 146 states have internal predecessors, (188), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:06:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 248 transitions. [2024-11-12 07:06:58,647 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 248 transitions. Word has length 132 [2024-11-12 07:06:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:58,649 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 248 transitions. [2024-11-12 07:06:58,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:06:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 248 transitions. [2024-11-12 07:06:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:06:58,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:58,651 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:06:58,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:06:58,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:58,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash 989841298, now seen corresponding path program 1 times [2024-11-12 07:06:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408213518] [2024-11-12 07:06:58,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:06:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:06:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:06:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:06:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:06:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:06:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:06:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408213518] [2024-11-12 07:06:59,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408213518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:59,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:59,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:06:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521712942] [2024-11-12 07:06:59,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:59,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:06:59,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:59,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:06:59,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:06:59,277 INFO L87 Difference]: Start difference. First operand 178 states and 248 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:06:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:59,756 INFO L93 Difference]: Finished difference Result 467 states and 645 transitions. [2024-11-12 07:06:59,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:06:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2024-11-12 07:06:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:59,760 INFO L225 Difference]: With dead ends: 467 [2024-11-12 07:06:59,760 INFO L226 Difference]: Without dead ends: 292 [2024-11-12 07:06:59,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:06:59,764 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 76 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:59,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 842 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:06:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-12 07:06:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-12 07:06:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 238 states have internal predecessors, (299), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 07:06:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2024-11-12 07:06:59,795 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 133 [2024-11-12 07:06:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:59,796 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2024-11-12 07:06:59,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:06:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2024-11-12 07:06:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:06:59,799 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:59,799 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:06:59,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:06:59,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:59,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash 754293936, now seen corresponding path program 1 times [2024-11-12 07:06:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:59,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385498036] [2024-11-12 07:06:59,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:59,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:07:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:07:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:07:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:07:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:07:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:07:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:07:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:07:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:07:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:07:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:07:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:07:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:07:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:07:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:07:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:07:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:07:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:07:00,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:07:00,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385498036] [2024-11-12 07:07:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385498036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:07:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357251313] [2024-11-12 07:07:00,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:00,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:07:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:07:00,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:07:00,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:07:00,380 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:07:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:00,966 INFO L93 Difference]: Finished difference Result 824 states and 1125 transitions. [2024-11-12 07:07:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:07:00,967 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-11-12 07:07:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:00,971 INFO L225 Difference]: With dead ends: 824 [2024-11-12 07:07:00,971 INFO L226 Difference]: Without dead ends: 535 [2024-11-12 07:07:00,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:07:00,974 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 97 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:00,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1237 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:07:00,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-12 07:07:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 327. [2024-11-12 07:07:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 274 states have (on average 1.2956204379562044) internal successors, (355), 277 states have internal predecessors, (355), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 07:07:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 451 transitions. [2024-11-12 07:07:01,020 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 451 transitions. Word has length 134 [2024-11-12 07:07:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:01,021 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 451 transitions. [2024-11-12 07:07:01,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:07:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 451 transitions. [2024-11-12 07:07:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:07:01,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:01,023 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:07:01,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:07:01,023 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:01,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash 264342387, now seen corresponding path program 1 times [2024-11-12 07:07:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:07:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277347380] [2024-11-12 07:07:01,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:07:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:07:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:07:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:07:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:07:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:07:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:07:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:07:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:07:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:07:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:07:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:07:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:07:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:07:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:07:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:07:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:07:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:07:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:07:01,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:07:01,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277347380] [2024-11-12 07:07:01,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277347380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:01,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:01,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:07:01,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375997707] [2024-11-12 07:07:01,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:01,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:07:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:07:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:07:01,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:07:01,738 INFO L87 Difference]: Start difference. First operand 327 states and 451 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:07:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:02,111 INFO L93 Difference]: Finished difference Result 778 states and 1066 transitions. [2024-11-12 07:07:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:07:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-11-12 07:07:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:02,116 INFO L225 Difference]: With dead ends: 778 [2024-11-12 07:07:02,117 INFO L226 Difference]: Without dead ends: 454 [2024-11-12 07:07:02,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:07:02,119 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 92 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:02,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 868 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:07:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-12 07:07:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 215. [2024-11-12 07:07:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 180 states have (on average 1.2833333333333334) internal successors, (231), 181 states have internal predecessors, (231), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:07:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 291 transitions. [2024-11-12 07:07:02,174 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 291 transitions. Word has length 134 [2024-11-12 07:07:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:02,175 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 291 transitions. [2024-11-12 07:07:02,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:07:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 291 transitions. [2024-11-12 07:07:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:07:02,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:02,177 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:07:02,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:07:02,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:02,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1148264091, now seen corresponding path program 1 times [2024-11-12 07:07:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:07:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420748124] [2024-11-12 07:07:02,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:02,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:07:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:07:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:07:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:07:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:07:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:07:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:07:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:07:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:07:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:07:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:07:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:07:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:07:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:07:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:07:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:07:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:07:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:07:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:07:02,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:07:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420748124] [2024-11-12 07:07:02,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420748124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:02,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:02,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:07:02,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244218669] [2024-11-12 07:07:02,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:02,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:07:02,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:07:02,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:07:02,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:07:02,707 INFO L87 Difference]: Start difference. First operand 215 states and 291 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:07:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:02,887 INFO L93 Difference]: Finished difference Result 490 states and 661 transitions. [2024-11-12 07:07:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:07:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-11-12 07:07:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:02,890 INFO L225 Difference]: With dead ends: 490 [2024-11-12 07:07:02,890 INFO L226 Difference]: Without dead ends: 278 [2024-11-12 07:07:02,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:07:02,892 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:02,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 588 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:07:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-12 07:07:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 275. [2024-11-12 07:07:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 237 states have (on average 1.2911392405063291) internal successors, (306), 239 states have internal predecessors, (306), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:07:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2024-11-12 07:07:02,927 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 135 [2024-11-12 07:07:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:02,928 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2024-11-12 07:07:02,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:07:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2024-11-12 07:07:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:07:02,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:02,930 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:07:02,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:07:02,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:02,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1735070105, now seen corresponding path program 1 times [2024-11-12 07:07:02,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:07:02,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905931902] [2024-11-12 07:07:02,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:07:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:07:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:07:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:07:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:07:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:07:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:07:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:07:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:07:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:07:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:07:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:07:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:07:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:07:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:07:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:07:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:07:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:07:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:07:04,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:07:04,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905931902] [2024-11-12 07:07:04,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905931902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:04,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 07:07:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25263071] [2024-11-12 07:07:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:04,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 07:07:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:07:04,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 07:07:04,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:07:04,214 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:07:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:05,486 INFO L93 Difference]: Finished difference Result 716 states and 949 transitions. [2024-11-12 07:07:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 07:07:05,487 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2024-11-12 07:07:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:05,490 INFO L225 Difference]: With dead ends: 716 [2024-11-12 07:07:05,491 INFO L226 Difference]: Without dead ends: 444 [2024-11-12 07:07:05,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 07:07:05,493 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 289 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:05,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1509 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:07:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-12 07:07:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 307. [2024-11-12 07:07:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 268 states have (on average 1.2835820895522387) internal successors, (344), 270 states have internal predecessors, (344), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:07:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 408 transitions. [2024-11-12 07:07:05,543 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 408 transitions. Word has length 135 [2024-11-12 07:07:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:05,543 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 408 transitions. [2024-11-12 07:07:05,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:07:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 408 transitions. [2024-11-12 07:07:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:07:05,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:05,546 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:07:05,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:07:05,546 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:05,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1874819568, now seen corresponding path program 1 times [2024-11-12 07:07:05,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:07:05,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827673727] [2024-11-12 07:07:05,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:07:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:07:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:07:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:07:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:07:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:07:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:07:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:07:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:07:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:07:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:07:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:07:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:07:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:07:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:07:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:07:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:07:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:07:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:07:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:07:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827673727] [2024-11-12 07:07:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827673727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:06,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:06,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:07:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054551426] [2024-11-12 07:07:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:06,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:07:06,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:07:06,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:07:06,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:07:06,700 INFO L87 Difference]: Start difference. First operand 307 states and 408 transitions. Second operand has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:07:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:08,337 INFO L93 Difference]: Finished difference Result 1561 states and 2065 transitions. [2024-11-12 07:07:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 07:07:08,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-11-12 07:07:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:08,345 INFO L225 Difference]: With dead ends: 1561 [2024-11-12 07:07:08,347 INFO L226 Difference]: Without dead ends: 1247 [2024-11-12 07:07:08,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:07:08,350 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 790 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:08,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 842 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 07:07:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-11-12 07:07:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 786. [2024-11-12 07:07:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 709 states have (on average 1.2750352609308886) internal successors, (904), 717 states have internal predecessors, (904), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 54 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 07:07:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1028 transitions. [2024-11-12 07:07:08,465 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1028 transitions. Word has length 135 [2024-11-12 07:07:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:08,469 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1028 transitions. [2024-11-12 07:07:08,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:07:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1028 transitions. [2024-11-12 07:07:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:07:08,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:08,472 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:07:08,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:07:08,472 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:08,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash -205276233, now seen corresponding path program 1 times [2024-11-12 07:07:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:07:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207635409] [2024-11-12 07:07:08,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:07:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:08,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:07:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:08,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:07:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:07:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:07:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:07:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:07:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:07:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:07:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:07:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:07:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:07:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:07:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:07:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:07:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:07:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:07:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:07:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:07:09,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:07:09,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207635409] [2024-11-12 07:07:09,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207635409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:07:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258167149] [2024-11-12 07:07:09,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:07:09,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:07:09,043 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) [2024-11-12 07:07:09,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:07:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 07:07:09,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:09,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-12 07:07:09,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2024-11-12 07:07:09,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2024-11-12 07:07:09,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2024-11-12 07:07:09,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 22 [2024-11-12 07:07:09,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:09,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 29 [2024-11-12 07:07:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 132 proven. 42 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-12 07:07:09,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:07:09,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2024-11-12 07:07:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:07:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258167149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:07:10,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:07:10,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2024-11-12 07:07:10,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366774355] [2024-11-12 07:07:10,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:07:10,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:07:10,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:07:10,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:07:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:07:10,078 INFO L87 Difference]: Start difference. First operand 786 states and 1028 transitions. Second operand has 13 states, 10 states have (on average 7.6) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-12 07:07:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:10,812 INFO L93 Difference]: Finished difference Result 1763 states and 2276 transitions. [2024-11-12 07:07:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 07:07:10,813 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.6) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) Word has length 135 [2024-11-12 07:07:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:10,819 INFO L225 Difference]: With dead ends: 1763 [2024-11-12 07:07:10,819 INFO L226 Difference]: Without dead ends: 980 [2024-11-12 07:07:10,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-12 07:07:10,821 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 389 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:10,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 444 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:07:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-11-12 07:07:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 723. [2024-11-12 07:07:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 637 states have (on average 1.2543171114599685) internal successors, (799), 645 states have internal predecessors, (799), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (62), 54 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 07:07:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 923 transitions. [2024-11-12 07:07:10,933 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 923 transitions. Word has length 135 [2024-11-12 07:07:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:10,934 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 923 transitions. [2024-11-12 07:07:10,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.6) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-12 07:07:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 923 transitions. [2024-11-12 07:07:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:07:10,947 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:10,947 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:07:10,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:07:11,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 07:07:11,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:11,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:11,149 INFO L85 PathProgramCache]: Analyzing trace with hash -792082247, now seen corresponding path program 1 times [2024-11-12 07:07:11,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:07:11,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418711545] [2024-11-12 07:07:11,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:07:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:07:11,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154081772] [2024-11-12 07:07:11,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:11,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:07:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:07:11,280 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) [2024-11-12 07:07:11,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 07:07:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:11,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-12 07:07:11,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:11,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 07:07:11,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:11,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-12 07:07:11,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:07:12,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:12,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2024-11-12 07:07:12,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 07:07:12,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 07:07:13,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2024-11-12 07:07:13,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2024-11-12 07:07:13,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:13,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 93 [2024-11-12 07:07:14,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 155 [2024-11-12 07:07:14,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:14,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 169 [2024-11-12 07:07:14,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 34 [2024-11-12 07:07:15,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:15,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 379 treesize of output 309 [2024-11-12 07:07:25,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:25,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 413 treesize of output 299 [2024-11-12 07:07:26,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:26,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 246 [2024-11-12 07:07:28,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:28,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 99 [2024-11-12 07:07:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 247 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-12 07:07:28,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:07:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:07:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418711545] [2024-11-12 07:07:36,565 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 07:07:36,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154081772] [2024-11-12 07:07:36,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154081772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:07:36,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:07:36,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2024-11-12 07:07:36,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086644698] [2024-11-12 07:07:36,565 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 07:07:36,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-12 07:07:36,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:07:36,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-12 07:07:36,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2119, Unknown=2, NotChecked=0, Total=2352 [2024-11-12 07:07:36,568 INFO L87 Difference]: Start difference. First operand 723 states and 923 transitions. Second operand has 35 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 33 states have internal predecessors, (77), 9 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (17), 7 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-12 07:07:49,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-12 07:07:55,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-12 07:08:06,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-12 07:08:17,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]