./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.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-ap_file-62.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 c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:22:22,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:22:22,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:22:22,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:22:22,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:22:22,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:22:22,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:22:22,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:22:22,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:22:22,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:22:22,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:22:22,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:22:22,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:22:22,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:22:22,860 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:22:22,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:22:22,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:22:22,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:22:22,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:22:22,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:22:22,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:22:22,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:22:22,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:22:22,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:22:22,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:22:22,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:22:22,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:22:22,865 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:22:22,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:22:22,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:22:22,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:22:22,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:22:22,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:22:22,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:22:22,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:22:22,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:22:22,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:22:22,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:22:22,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:22:22,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:22:22,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:22:22,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:22:22,870 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 -> c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 [2024-11-12 07:22:23,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:22:23,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:22:23,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:22:23,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:22:23,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:22:23,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2024-11-12 07:22:24,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:22:24,809 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:22:24,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2024-11-12 07:22:24,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8542ded9/2357016f3817436fb0ee87473b593882/FLAG3c4f083c7 [2024-11-12 07:22:24,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8542ded9/2357016f3817436fb0ee87473b593882 [2024-11-12 07:22:24,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:22:24,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:22:24,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:22:24,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:22:24,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:22:24,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:22:24" (1/1) ... [2024-11-12 07:22:24,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0201a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:24, skipping insertion in model container [2024-11-12 07:22:24,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:22:24" (1/1) ... [2024-11-12 07:22:24,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:22:25,069 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-ap_file-62.i[917,930] [2024-11-12 07:22:25,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:22:25,155 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:22:25,168 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-ap_file-62.i[917,930] [2024-11-12 07:22:25,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:22:25,239 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:22:25,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25 WrapperNode [2024-11-12 07:22:25,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:22:25,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:22:25,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:22:25,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:22:25,249 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:22:25" (1/1) ... [2024-11-12 07:22:25,261 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:22:25" (1/1) ... [2024-11-12 07:22:25,302 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 340 [2024-11-12 07:22:25,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:22:25,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:22:25,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:22:25,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:22:25,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,347 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2024-11-12 07:22:25,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:22:25,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:22:25,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:22:25,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:22:25,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (1/1) ... [2024-11-12 07:22:25,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:22:25,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:22:25,412 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:22:25,414 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:22:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:22:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:22:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:22:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:22:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:22:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:22:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:22:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:22:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:22:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:22:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:22:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:22:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:22:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:22:25,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:22:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:22:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:22:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:22:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:22:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:22:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:22:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:22:25,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:22:25,576 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:22:25,595 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:22:26,001 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-11-12 07:22:26,001 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:22:26,019 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:22:26,020 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:22:26,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:22:26 BoogieIcfgContainer [2024-11-12 07:22:26,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:22:26,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:22:26,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:22:26,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:22:26,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:22:24" (1/3) ... [2024-11-12 07:22:26,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1811fa01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:22:26, skipping insertion in model container [2024-11-12 07:22:26,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:22:25" (2/3) ... [2024-11-12 07:22:26,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1811fa01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:22:26, skipping insertion in model container [2024-11-12 07:22:26,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:22:26" (3/3) ... [2024-11-12 07:22:26,033 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-62.i [2024-11-12 07:22:26,047 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:22:26,047 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:22:26,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:22:26,111 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;@110fd258, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:22:26,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:22:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:22:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 07:22:26,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:26,126 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:26,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:26,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash 40765512, now seen corresponding path program 1 times [2024-11-12 07:22:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:26,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237451592] [2024-11-12 07:22:26,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:26,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237451592] [2024-11-12 07:22:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237451592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:26,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:26,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:22:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602389550] [2024-11-12 07:22:26,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:26,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:22:26,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:26,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:22:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:22:26,526 INFO L87 Difference]: Start difference. First operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:22:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:26,560 INFO L93 Difference]: Finished difference Result 139 states and 210 transitions. [2024-11-12 07:22:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:22:26,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-11-12 07:22:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:26,570 INFO L225 Difference]: With dead ends: 139 [2024-11-12 07:22:26,571 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 07:22:26,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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:22:26,576 INFO L435 NwaCegarLoop]: 97 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, 97 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:22:26,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:22:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 07:22:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-12 07:22:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:22:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-11-12 07:22:26,613 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 73 [2024-11-12 07:22:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:26,613 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-11-12 07:22:26,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:22:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-11-12 07:22:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 07:22:26,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:26,617 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:26,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:22:26,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:26,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2068201528, now seen corresponding path program 1 times [2024-11-12 07:22:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014300863] [2024-11-12 07:22:26,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014300863] [2024-11-12 07:22:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014300863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:22:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848460638] [2024-11-12 07:22:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:26,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:22:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:26,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:22:26,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:22:26,949 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:27,004 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2024-11-12 07:22:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:22:27,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-12 07:22:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:27,008 INFO L225 Difference]: With dead ends: 138 [2024-11-12 07:22:27,009 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 07:22:27,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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:22:27,012 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:27,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:22:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 07:22:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-12 07:22:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:22:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-11-12 07:22:27,024 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 73 [2024-11-12 07:22:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:27,026 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-12 07:22:27,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-11-12 07:22:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 07:22:27,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:27,028 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:27,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:22:27,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:27,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash -451758406, now seen corresponding path program 1 times [2024-11-12 07:22:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538953964] [2024-11-12 07:22:27,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:27,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538953964] [2024-11-12 07:22:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538953964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:27,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:22:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237297491] [2024-11-12 07:22:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:27,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:22:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:22:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:22:27,207 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:27,239 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2024-11-12 07:22:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:22:27,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-12 07:22:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:27,243 INFO L225 Difference]: With dead ends: 142 [2024-11-12 07:22:27,244 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 07:22:27,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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:22:27,247 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:27,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:22:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 07:22:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-12 07:22:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:22:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-11-12 07:22:27,256 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 73 [2024-11-12 07:22:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:27,256 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-11-12 07:22:27,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-12 07:22:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 07:22:27,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:27,258 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:27,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:22:27,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:27,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash -449911364, now seen corresponding path program 1 times [2024-11-12 07:22:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:27,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541003208] [2024-11-12 07:22:27,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:27,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:27,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541003208] [2024-11-12 07:22:27,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541003208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:27,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:27,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:22:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086183556] [2024-11-12 07:22:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:27,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:22:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:27,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:22:27,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:22:27,811 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:22:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:28,013 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2024-11-12 07:22:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:22:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-11-12 07:22:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:28,015 INFO L225 Difference]: With dead ends: 153 [2024-11-12 07:22:28,016 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 07:22:28,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:22:28,020 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 146 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:28,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 198 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:22:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 07:22:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-11-12 07:22:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 70 states have internal predecessors, (90), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:22:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2024-11-12 07:22:28,038 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 73 [2024-11-12 07:22:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:28,038 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2024-11-12 07:22:28,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:22:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2024-11-12 07:22:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 07:22:28,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:28,040 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:28,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:22:28,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:28,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1275248375, now seen corresponding path program 1 times [2024-11-12 07:22:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741571405] [2024-11-12 07:22:28,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:28,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741571405] [2024-11-12 07:22:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741571405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:28,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:22:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758975307] [2024-11-12 07:22:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:22:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:28,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:22:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:28,348 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:28,481 INFO L93 Difference]: Finished difference Result 209 states and 280 transitions. [2024-11-12 07:22:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:22:28,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-11-12 07:22:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:28,485 INFO L225 Difference]: With dead ends: 209 [2024-11-12 07:22:28,486 INFO L226 Difference]: Without dead ends: 135 [2024-11-12 07:22:28,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:22:28,488 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:28,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 522 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:22:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-12 07:22:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 92. [2024-11-12 07:22:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 80 states have internal predecessors, (104), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:22:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2024-11-12 07:22:28,506 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 75 [2024-11-12 07:22:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:28,507 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2024-11-12 07:22:28,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2024-11-12 07:22:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 07:22:28,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:28,508 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:28,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:22:28,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:28,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash -181576739, now seen corresponding path program 1 times [2024-11-12 07:22:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:28,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439356811] [2024-11-12 07:22:28,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:28,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:28,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439356811] [2024-11-12 07:22:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439356811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:28,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:28,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:22:28,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926583806] [2024-11-12 07:22:28,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:28,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:22:28,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:28,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:22:28,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:22:28,749 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:28,834 INFO L93 Difference]: Finished difference Result 211 states and 284 transitions. [2024-11-12 07:22:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:22:28,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-11-12 07:22:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:28,836 INFO L225 Difference]: With dead ends: 211 [2024-11-12 07:22:28,836 INFO L226 Difference]: Without dead ends: 127 [2024-11-12 07:22:28,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:28,838 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:28,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 481 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:22:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-12 07:22:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2024-11-12 07:22:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:22:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2024-11-12 07:22:28,850 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 77 [2024-11-12 07:22:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:28,850 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2024-11-12 07:22:28,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2024-11-12 07:22:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 07:22:28,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:28,852 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:28,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:22:28,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:28,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash 738895874, now seen corresponding path program 1 times [2024-11-12 07:22:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917579943] [2024-11-12 07:22:28,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:28,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:29,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917579943] [2024-11-12 07:22:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917579943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:29,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:29,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:22:29,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860475852] [2024-11-12 07:22:29,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:29,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:22:29,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:22:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:22:29,022 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:29,052 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2024-11-12 07:22:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:22:29,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-11-12 07:22:29,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:29,054 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:22:29,055 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 07:22:29,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:22:29,056 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:29,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:22:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 07:22:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-12 07:22:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 83 states have internal predecessors, (106), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:22:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2024-11-12 07:22:29,071 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 77 [2024-11-12 07:22:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:29,071 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2024-11-12 07:22:29,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2024-11-12 07:22:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 07:22:29,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:29,075 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:29,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:22:29,076 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:29,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2084098479, now seen corresponding path program 1 times [2024-11-12 07:22:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:29,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191568778] [2024-11-12 07:22:29,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191568778] [2024-11-12 07:22:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191568778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:22:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311119082] [2024-11-12 07:22:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:22:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:22:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:22:29,276 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:29,337 INFO L93 Difference]: Finished difference Result 215 states and 284 transitions. [2024-11-12 07:22:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:22:29,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-11-12 07:22:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:29,339 INFO L225 Difference]: With dead ends: 215 [2024-11-12 07:22:29,340 INFO L226 Difference]: Without dead ends: 128 [2024-11-12 07:22:29,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:29,341 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 46 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:29,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 367 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:22:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-12 07:22:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2024-11-12 07:22:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:22:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2024-11-12 07:22:29,359 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 77 [2024-11-12 07:22:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:29,360 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2024-11-12 07:22:29,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-11-12 07:22:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:22:29,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:29,361 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:29,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:22:29,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:29,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1933694537, now seen corresponding path program 1 times [2024-11-12 07:22:29,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:29,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891206504] [2024-11-12 07:22:29,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:29,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 07:22:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:30,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891206504] [2024-11-12 07:22:30,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891206504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:22:30,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001313516] [2024-11-12 07:22:30,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:30,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:22:30,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:22:30,104 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:22:30,106 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:22:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:30,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-12 07:22:30,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:22:31,108 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 8 treesize of output 1 [2024-11-12 07:22:31,218 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 121 treesize of output 93 [2024-11-12 07:22:31,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 99 [2024-11-12 07:22:31,270 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 27 treesize of output 15 [2024-11-12 07:22:31,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 74 treesize of output 42 [2024-11-12 07:22:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 07:22:31,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:22:32,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 07:22:32,171 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 902 treesize of output 842 [2024-11-12 07:22:32,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 160 treesize of output 150 [2024-11-12 07:22:32,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 150 treesize of output 138 [2024-11-12 07:22:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:32,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001313516] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:22:32,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:22:32,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 12] total 28 [2024-11-12 07:22:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126548456] [2024-11-12 07:22:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:32,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:22:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:22:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-11-12 07:22:32,466 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:33,116 INFO L93 Difference]: Finished difference Result 240 states and 314 transitions. [2024-11-12 07:22:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:22:33,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-12 07:22:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:33,118 INFO L225 Difference]: With dead ends: 240 [2024-11-12 07:22:33,118 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 07:22:33,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 07:22:33,120 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 229 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:33,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 764 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:22:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 07:22:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 105. [2024-11-12 07:22:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 93 states have internal predecessors, (119), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:22:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2024-11-12 07:22:33,135 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 79 [2024-11-12 07:22:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:33,136 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2024-11-12 07:22:33,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2024-11-12 07:22:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:22:33,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:33,138 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:33,156 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:22:33,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:22:33,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:33,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1081409081, now seen corresponding path program 1 times [2024-11-12 07:22:33,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:33,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685804842] [2024-11-12 07:22:33,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:33,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:33,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:33,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:33,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:33,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:33,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:33,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685804842] [2024-11-12 07:22:33,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685804842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:33,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:33,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:22:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483438301] [2024-11-12 07:22:33,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:33,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:22:33,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:33,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:22:33,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:22:33,702 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:22:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:33,940 INFO L93 Difference]: Finished difference Result 250 states and 325 transitions. [2024-11-12 07:22:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:22:33,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2024-11-12 07:22:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:33,942 INFO L225 Difference]: With dead ends: 250 [2024-11-12 07:22:33,942 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 07:22:33,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:22:33,943 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 201 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:33,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 411 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:22:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 07:22:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 100. [2024-11-12 07:22:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:22:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2024-11-12 07:22:33,952 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 79 [2024-11-12 07:22:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:33,952 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2024-11-12 07:22:33,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:22:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2024-11-12 07:22:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:22:33,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:33,953 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:33,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:22:33,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:33,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1714839819, now seen corresponding path program 1 times [2024-11-12 07:22:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:33,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991797097] [2024-11-12 07:22:33,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:33,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:34,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:34,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:34,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:34,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991797097] [2024-11-12 07:22:34,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991797097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:34,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:34,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:22:34,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547159694] [2024-11-12 07:22:34,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:34,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:22:34,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:22:34,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:22:34,248 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:22:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:34,487 INFO L93 Difference]: Finished difference Result 238 states and 310 transitions. [2024-11-12 07:22:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:22:34,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2024-11-12 07:22:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:34,488 INFO L225 Difference]: With dead ends: 238 [2024-11-12 07:22:34,489 INFO L226 Difference]: Without dead ends: 141 [2024-11-12 07:22:34,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:22:34,489 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 225 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:34,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 462 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:22:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-12 07:22:34,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2024-11-12 07:22:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:22:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2024-11-12 07:22:34,502 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 79 [2024-11-12 07:22:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:34,502 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2024-11-12 07:22:34,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:22:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2024-11-12 07:22:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:22:34,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:34,503 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:34,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:22:34,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:34,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1300263799, now seen corresponding path program 1 times [2024-11-12 07:22:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:34,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773077955] [2024-11-12 07:22:34,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:34,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:35,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:35,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:35,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:35,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 07:22:35,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773077955] [2024-11-12 07:22:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773077955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:22:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150216616] [2024-11-12 07:22:35,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:35,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:22:35,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:22:35,944 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:22:35,945 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:22:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:36,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-12 07:22:36,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:22:36,962 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 15 treesize of output 1 [2024-11-12 07:22:37,429 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 15 treesize of output 1 [2024-11-12 07:22:38,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:22:38,467 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 23 treesize of output 11 [2024-11-12 07:22:38,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:22:38,536 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 19 treesize of output 18 [2024-11-12 07:22:38,709 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 62 treesize of output 46 [2024-11-12 07:22:38,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:22:38,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:22:38,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 74 [2024-11-12 07:22:38,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:22:38,775 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 29 treesize of output 20 [2024-11-12 07:22:38,919 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 15 treesize of output 7 [2024-11-12 07:22:38,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:22:38,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 81 [2024-11-12 07:22:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 92 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-12 07:22:39,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:22:39,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse2 (select (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset))) (and (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse1 (select v_ArrVal_262 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (not (= v_ArrVal_262 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse1))) (< (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_262) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse2) (< 0 (+ .cse1 1)) (< (+ .cse1 128) 0)))) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse3 (select v_ArrVal_262 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< 127 .cse3) (< .cse3 0) (not (= v_ArrVal_262 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse3))) (< (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_262) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse2)))))) is different from false [2024-11-12 07:22:39,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base (store (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 14)))) (let ((.cse2 (select (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (.cse3 (select .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse0 (select v_ArrVal_262 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< 127 .cse0) (< .cse0 0) (< (select (select (store .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_262) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse2) (not (= v_ArrVal_262 (store .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse0)))))) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse4 (select v_ArrVal_262 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< (select (select (store .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_262) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse2) (< 0 (+ .cse4 1)) (< (+ .cse4 128) 0) (not (= v_ArrVal_262 (store .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse4))))))))) is different from false [2024-11-12 07:22:39,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base (store (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 14)))) (let ((.cse2 (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse3 (select .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_262 (Array Int Int)) (v_ArrVal_259 Int)) (let ((.cse0 (select v_ArrVal_262 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< 127 .cse0) (< .cse0 0) (< (select (select (store .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_262) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (select (select (store |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset v_ArrVal_259)) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (not (= v_ArrVal_262 (store .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse0)))))) (forall ((v_ArrVal_262 (Array Int Int)) (v_ArrVal_259 Int)) (let ((.cse4 (select v_ArrVal_262 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< (select (select (store .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_262) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (select (select (store |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset v_ArrVal_259)) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (< 0 (+ .cse4 1)) (< (+ .cse4 128) 0) (not (= v_ArrVal_262 (store .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse4))))))))) is different from false [2024-11-12 07:22:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150216616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:22:39,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:22:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-11-12 07:22:39,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302129676] [2024-11-12 07:22:39,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:22:39,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 07:22:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 07:22:39,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=789, Unknown=3, NotChecked=174, Total=1056 [2024-11-12 07:22:39,480 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 28 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 07:22:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:44,147 INFO L93 Difference]: Finished difference Result 526 states and 658 transitions. [2024-11-12 07:22:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-12 07:22:44,148 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) Word has length 79 [2024-11-12 07:22:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:44,150 INFO L225 Difference]: With dead ends: 526 [2024-11-12 07:22:44,150 INFO L226 Difference]: Without dead ends: 429 [2024-11-12 07:22:44,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1151, Invalid=4710, Unknown=3, NotChecked=456, Total=6320 [2024-11-12 07:22:44,154 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 2542 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 314 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2542 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:44,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2542 Valid, 692 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1195 Invalid, 1 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 07:22:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-12 07:22:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 224. [2024-11-12 07:22:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 194 states have (on average 1.2268041237113403) internal successors, (238), 195 states have internal predecessors, (238), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:22:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 278 transitions. [2024-11-12 07:22:44,187 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 278 transitions. Word has length 79 [2024-11-12 07:22:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:44,188 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 278 transitions. [2024-11-12 07:22:44,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 07:22:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 278 transitions. [2024-11-12 07:22:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:22:44,189 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:44,189 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:44,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 07:22:44,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-12 07:22:44,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash -715700954, now seen corresponding path program 1 times [2024-11-12 07:22:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:44,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913309730] [2024-11-12 07:22:44,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:44,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:45,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:45,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:45,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:45,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:45,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:45,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913309730] [2024-11-12 07:22:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913309730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 07:22:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409732104] [2024-11-12 07:22:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:45,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 07:22:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 07:22:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:22:45,709 INFO L87 Difference]: Start difference. First operand 224 states and 278 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-12 07:22:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:46,461 INFO L93 Difference]: Finished difference Result 512 states and 638 transitions. [2024-11-12 07:22:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:22:46,463 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2024-11-12 07:22:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:46,464 INFO L225 Difference]: With dead ends: 512 [2024-11-12 07:22:46,465 INFO L226 Difference]: Without dead ends: 304 [2024-11-12 07:22:46,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2024-11-12 07:22:46,466 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 204 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:46,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1055 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:22:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-12 07:22:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 216. [2024-11-12 07:22:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 186 states have (on average 1.2258064516129032) internal successors, (228), 187 states have internal predecessors, (228), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:22:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 268 transitions. [2024-11-12 07:22:46,502 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 268 transitions. Word has length 80 [2024-11-12 07:22:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:46,502 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 268 transitions. [2024-11-12 07:22:46,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-12 07:22:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 268 transitions. [2024-11-12 07:22:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:22:46,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:46,504 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:46,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:22:46,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:46,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash 433053927, now seen corresponding path program 1 times [2024-11-12 07:22:46,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:46,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477229913] [2024-11-12 07:22:46,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:46,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:46,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477229913] [2024-11-12 07:22:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477229913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:46,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:22:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312889966] [2024-11-12 07:22:46,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:46,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:22:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:22:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:46,648 INFO L87 Difference]: Start difference. First operand 216 states and 268 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:46,709 INFO L93 Difference]: Finished difference Result 424 states and 527 transitions. [2024-11-12 07:22:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:22:46,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-12 07:22:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:46,711 INFO L225 Difference]: With dead ends: 424 [2024-11-12 07:22:46,711 INFO L226 Difference]: Without dead ends: 224 [2024-11-12 07:22:46,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:46,713 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:46,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:22:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-12 07:22:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2024-11-12 07:22:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 189 states have internal predecessors, (230), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:22:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 270 transitions. [2024-11-12 07:22:46,747 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 270 transitions. Word has length 80 [2024-11-12 07:22:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:46,748 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 270 transitions. [2024-11-12 07:22:46,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 270 transitions. [2024-11-12 07:22:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:22:46,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:46,749 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:46,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:22:46,749 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:46,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1972705984, now seen corresponding path program 1 times [2024-11-12 07:22:46,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:46,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068497231] [2024-11-12 07:22:46,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:46,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:46,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:46,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068497231] [2024-11-12 07:22:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068497231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:46,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:46,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:22:46,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660398565] [2024-11-12 07:22:46,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:46,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:22:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:46,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:22:46,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:22:46,875 INFO L87 Difference]: Start difference. First operand 218 states and 270 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:46,992 INFO L93 Difference]: Finished difference Result 420 states and 521 transitions. [2024-11-12 07:22:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:22:46,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-12 07:22:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:46,994 INFO L225 Difference]: With dead ends: 420 [2024-11-12 07:22:46,995 INFO L226 Difference]: Without dead ends: 218 [2024-11-12 07:22:46,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:46,996 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 52 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:46,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 215 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:22:46,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-12 07:22:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-12 07:22:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 188 states have (on average 1.2127659574468086) internal successors, (228), 189 states have internal predecessors, (228), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:22:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 268 transitions. [2024-11-12 07:22:47,026 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 268 transitions. Word has length 80 [2024-11-12 07:22:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:47,026 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 268 transitions. [2024-11-12 07:22:47,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 268 transitions. [2024-11-12 07:22:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 07:22:47,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:47,028 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:47,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:22:47,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:47,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash -718955474, now seen corresponding path program 1 times [2024-11-12 07:22:47,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:47,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841910703] [2024-11-12 07:22:47,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:47,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:47,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841910703] [2024-11-12 07:22:47,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841910703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:47,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:47,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:22:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650177921] [2024-11-12 07:22:47,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:47,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:22:47,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:47,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:22:47,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:22:47,162 INFO L87 Difference]: Start difference. First operand 218 states and 268 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:47,236 INFO L93 Difference]: Finished difference Result 492 states and 606 transitions. [2024-11-12 07:22:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:22:47,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-11-12 07:22:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:47,239 INFO L225 Difference]: With dead ends: 492 [2024-11-12 07:22:47,240 INFO L226 Difference]: Without dead ends: 290 [2024-11-12 07:22:47,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:47,241 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 45 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:47,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 325 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:22:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-12 07:22:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 218. [2024-11-12 07:22:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 188 states have (on average 1.202127659574468) internal successors, (226), 189 states have internal predecessors, (226), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:22:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 266 transitions. [2024-11-12 07:22:47,281 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 266 transitions. Word has length 82 [2024-11-12 07:22:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:47,281 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 266 transitions. [2024-11-12 07:22:47,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 266 transitions. [2024-11-12 07:22:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 07:22:47,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:47,282 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:47,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:22:47,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash -275985652, now seen corresponding path program 1 times [2024-11-12 07:22:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582131832] [2024-11-12 07:22:47,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:47,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:47,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582131832] [2024-11-12 07:22:47,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582131832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:47,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:47,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:22:47,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966311181] [2024-11-12 07:22:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:47,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:22:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:47,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:22:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:22:47,426 INFO L87 Difference]: Start difference. First operand 218 states and 266 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:47,505 INFO L93 Difference]: Finished difference Result 484 states and 594 transitions. [2024-11-12 07:22:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:22:47,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2024-11-12 07:22:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:47,508 INFO L225 Difference]: With dead ends: 484 [2024-11-12 07:22:47,508 INFO L226 Difference]: Without dead ends: 282 [2024-11-12 07:22:47,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:47,509 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 35 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:47,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 324 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:22:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-12 07:22:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 228. [2024-11-12 07:22:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 198 states have (on average 1.1919191919191918) internal successors, (236), 199 states have internal predecessors, (236), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:22:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 276 transitions. [2024-11-12 07:22:47,543 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 276 transitions. Word has length 83 [2024-11-12 07:22:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:47,544 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 276 transitions. [2024-11-12 07:22:47,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 276 transitions. [2024-11-12 07:22:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 07:22:47,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:47,545 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:47,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:22:47,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:47,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:47,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2010953120, now seen corresponding path program 1 times [2024-11-12 07:22:47,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:47,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279992860] [2024-11-12 07:22:47,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:48,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279992860] [2024-11-12 07:22:48,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279992860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:22:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441282825] [2024-11-12 07:22:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:48,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:22:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:22:48,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:22:48,038 INFO L87 Difference]: Start difference. First operand 228 states and 276 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-12 07:22:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:48,443 INFO L93 Difference]: Finished difference Result 543 states and 648 transitions. [2024-11-12 07:22:48,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:22:48,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2024-11-12 07:22:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:48,445 INFO L225 Difference]: With dead ends: 543 [2024-11-12 07:22:48,446 INFO L226 Difference]: Without dead ends: 331 [2024-11-12 07:22:48,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2024-11-12 07:22:48,447 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 151 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:48,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 647 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:22:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-12 07:22:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 209. [2024-11-12 07:22:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 177 states have (on average 1.152542372881356) internal successors, (204), 179 states have internal predecessors, (204), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:22:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2024-11-12 07:22:48,486 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 83 [2024-11-12 07:22:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:48,486 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2024-11-12 07:22:48,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-12 07:22:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2024-11-12 07:22:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 07:22:48,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:48,488 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:48,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:22:48,488 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:48,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash 478575842, now seen corresponding path program 1 times [2024-11-12 07:22:48,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:48,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329010207] [2024-11-12 07:22:48,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:48,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:22:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:22:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:22:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:22:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:22:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:22:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:22:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:22:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:22:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:22:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329010207] [2024-11-12 07:22:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329010207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:48,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:22:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679833885] [2024-11-12 07:22:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:48,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:22:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:22:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:22:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:22:48,582 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:48,727 INFO L93 Difference]: Finished difference Result 438 states and 513 transitions. [2024-11-12 07:22:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:22:48,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2024-11-12 07:22:48,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:48,729 INFO L225 Difference]: With dead ends: 438 [2024-11-12 07:22:48,729 INFO L226 Difference]: Without dead ends: 257 [2024-11-12 07:22:48,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:48,730 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 43 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:48,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 423 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:22:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-12 07:22:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 224. [2024-11-12 07:22:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.1458333333333333) internal successors, (220), 194 states have internal predecessors, (220), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:22:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 260 transitions. [2024-11-12 07:22:48,766 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 260 transitions. Word has length 83 [2024-11-12 07:22:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:48,767 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 260 transitions. [2024-11-12 07:22:48,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:22:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 260 transitions. [2024-11-12 07:22:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 07:22:48,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:48,768 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:48,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:22:48,768 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:48,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash -62616729, now seen corresponding path program 1 times [2024-11-12 07:22:48,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:22:48,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923895061] [2024-11-12 07:22:48,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:48,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:22:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat