./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:03:54,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:03:54,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:03:54,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:03:54,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:03:54,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:03:54,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:03:54,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:03:54,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:03:54,626 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:03:54,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:03:54,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:03:54,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:03:54,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:03:54,630 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:03:54,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:03:54,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:03:54,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:03:54,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:03:54,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:03:54,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:03:54,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:03:54,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:03:54,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:03:54,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:03:54,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:03:54,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:03:54,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:03:54,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:03:54,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:03:54,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:03:54,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:03:54,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:03:54,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:03:54,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:03:54,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:03:54,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:03:54,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:03:54,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:03:54,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:03:54,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:03:54,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:03:54,635 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-clean/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-clean/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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2024-10-11 14:03:54,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:03:54,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:03:54,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:03:54,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:03:54,864 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:03:54,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-10-11 14:03:56,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:03:56,340 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:03:56,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-10-11 14:03:56,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a0ad9da8/396185025af64cc0bf25cfebc3416c03/FLAGacdaf6a24 [2024-10-11 14:03:56,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a0ad9da8/396185025af64cc0bf25cfebc3416c03 [2024-10-11 14:03:56,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:03:56,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:03:56,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:03:56,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:03:56,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:03:56,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:56,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6710e876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56, skipping insertion in model container [2024-10-11 14:03:56,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:56,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:03:56,864 WARN L248 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-sp_file-8.i[916,929] [2024-10-11 14:03:56,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:03:56,921 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:03:56,931 WARN L248 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-sp_file-8.i[916,929] [2024-10-11 14:03:56,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:03:56,971 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:03:56,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56 WrapperNode [2024-10-11 14:03:56,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:03:56,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:03:56,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:03:56,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:03:56,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:56,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,018 INFO L138 Inliner]: procedures = 29, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2024-10-11 14:03:57,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:03:57,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:03:57,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:03:57,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:03:57,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,050 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2024-10-11 14:03:57,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:03:57,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:03:57,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:03:57,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:03:57,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (1/1) ... [2024-10-11 14:03:57,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:03:57,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:03:57,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:03:57,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:03:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:03:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:03:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:03:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:03:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:03:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:03:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:03:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:03:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:03:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:03:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:03:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:03:57,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:03:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:03:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:03:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:03:57,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:03:57,260 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:03:57,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:03:57,706 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-11 14:03:57,706 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:03:57,759 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:03:57,761 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:03:57,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:03:57 BoogieIcfgContainer [2024-10-11 14:03:57,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:03:57,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:03:57,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:03:57,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:03:57,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:03:56" (1/3) ... [2024-10-11 14:03:57,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279c01f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:03:57, skipping insertion in model container [2024-10-11 14:03:57,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:56" (2/3) ... [2024-10-11 14:03:57,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279c01f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:03:57, skipping insertion in model container [2024-10-11 14:03:57,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:03:57" (3/3) ... [2024-10-11 14:03:57,769 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2024-10-11 14:03:57,782 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:03:57,783 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:03:57,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:03:57,867 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;@44aa12f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:03:57,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:03:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:03:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:03:57,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:57,879 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:03:57,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:57,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1665721735, now seen corresponding path program 1 times [2024-10-11 14:03:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:57,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859434381] [2024-10-11 14:03:57,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:57,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:03:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:03:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:03:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:03:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:03:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:03:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859434381] [2024-10-11 14:03:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859434381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:03:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856423899] [2024-10-11 14:03:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:58,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:03:58,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:58,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:03:58,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:03:58,298 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:03:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:58,335 INFO L93 Difference]: Finished difference Result 183 states and 288 transitions. [2024-10-11 14:03:58,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:03:58,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-10-11 14:03:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:58,349 INFO L225 Difference]: With dead ends: 183 [2024-10-11 14:03:58,349 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 14:03:58,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10-11 14:03:58,356 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:58,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:03:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 14:03:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 14:03:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:03:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-11 14:03:58,391 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 118 [2024-10-11 14:03:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:58,392 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-11 14:03:58,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:03:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-11 14:03:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:03:58,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:58,395 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:03:58,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:03:58,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:58,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1494754021, now seen corresponding path program 1 times [2024-10-11 14:03:58,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:58,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724183835] [2024-10-11 14:03:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:03:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:03:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:03:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:03:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:03:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:03:58,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:58,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724183835] [2024-10-11 14:03:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724183835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:58,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:03:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547898730] [2024-10-11 14:03:58,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:58,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:03:58,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:58,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:03:58,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:03:58,757 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:03:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:58,810 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-10-11 14:03:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:03:58,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 14:03:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:58,815 INFO L225 Difference]: With dead ends: 184 [2024-10-11 14:03:58,815 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 14:03:58,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-11 14:03:58,817 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:58,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:03:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 14:03:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-10-11 14:03:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:03:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-10-11 14:03:58,830 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 118 [2024-10-11 14:03:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:58,831 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-10-11 14:03:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:03:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-10-11 14:03:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:03:58,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:58,834 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:03:58,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:03:58,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:58,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:58,835 INFO L85 PathProgramCache]: Analyzing trace with hash 685407395, now seen corresponding path program 1 times [2024-10-11 14:03:58,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:58,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396848057] [2024-10-11 14:03:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:58,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:03:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:03:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:03:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:03:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:03:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:03:59,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:59,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396848057] [2024-10-11 14:03:59,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396848057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:59,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:59,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:03:59,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021497149] [2024-10-11 14:03:59,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:59,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:03:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:59,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:03:59,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:03:59,063 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:03:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:59,108 INFO L93 Difference]: Finished difference Result 188 states and 273 transitions. [2024-10-11 14:03:59,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:03:59,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 14:03:59,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:59,110 INFO L225 Difference]: With dead ends: 188 [2024-10-11 14:03:59,110 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 14:03:59,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-11 14:03:59,111 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:59,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 372 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:03:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 14:03:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-11 14:03:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:03:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-10-11 14:03:59,123 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 118 [2024-10-11 14:03:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:59,123 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-10-11 14:03:59,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:03:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-10-11 14:03:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:03:59,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:59,128 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:03:59,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:03:59,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:59,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash 742665697, now seen corresponding path program 1 times [2024-10-11 14:03:59,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:59,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388491553] [2024-10-11 14:03:59,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:59,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:03:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:03:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:03:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:03:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:03:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:03:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:59,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388491553] [2024-10-11 14:03:59,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388491553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:59,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:59,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:03:59,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224420420] [2024-10-11 14:03:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:59,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:03:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:03:59,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:03:59,328 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:03:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:59,371 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-10-11 14:03:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:03:59,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 14:03:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:59,373 INFO L225 Difference]: With dead ends: 192 [2024-10-11 14:03:59,373 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 14:03:59,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-11 14:03:59,374 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:59,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:03:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 14:03:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-11 14:03:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:03:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-10-11 14:03:59,386 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 118 [2024-10-11 14:03:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:59,389 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-10-11 14:03:59,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:03:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-10-11 14:03:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:03:59,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:59,390 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:03:59,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:03:59,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:59,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash 742725279, now seen corresponding path program 1 times [2024-10-11 14:03:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27458343] [2024-10-11 14:03:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:04:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:04:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:00,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27458343] [2024-10-11 14:04:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27458343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:04:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745827501] [2024-10-11 14:04:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:00,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:04:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:04:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:04:00,638 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 14:04:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:00,977 INFO L93 Difference]: Finished difference Result 194 states and 278 transitions. [2024-10-11 14:04:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:04:00,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2024-10-11 14:04:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:00,979 INFO L225 Difference]: With dead ends: 194 [2024-10-11 14:04:00,979 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 14:04:00,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:04:00,980 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 248 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:00,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 268 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:04:00,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 14:04:00,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-11 14:04:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-10-11 14:04:00,990 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 118 [2024-10-11 14:04:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:00,990 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-10-11 14:04:00,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 14:04:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-10-11 14:04:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:04:00,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:00,992 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:04:00,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:04:00,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:00,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1251419427, now seen corresponding path program 1 times [2024-10-11 14:04:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:00,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005000368] [2024-10-11 14:04:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:00,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:04:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:04:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:01,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:01,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005000368] [2024-10-11 14:04:01,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005000368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:01,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:01,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:04:01,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936416535] [2024-10-11 14:04:01,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:01,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:04:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:01,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:04:01,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:01,416 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:01,591 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2024-10-11 14:04:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:04:01,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 14:04:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:01,595 INFO L225 Difference]: With dead ends: 229 [2024-10-11 14:04:01,595 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 14:04:01,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:04:01,596 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 142 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:01,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 452 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:04:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 14:04:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2024-10-11 14:04:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-10-11 14:04:01,618 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 118 [2024-10-11 14:04:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:01,619 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-10-11 14:04:01,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-10-11 14:04:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 14:04:01,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:01,620 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:04:01,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:04:01,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:01,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1680188958, now seen corresponding path program 1 times [2024-10-11 14:04:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970838019] [2024-10-11 14:04:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:04:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:04:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:02,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:02,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970838019] [2024-10-11 14:04:02,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970838019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:02,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:02,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:04:02,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566866640] [2024-10-11 14:04:02,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:02,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:04:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:02,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:04:02,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:04:02,912 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:03,625 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2024-10-11 14:04:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:04:03,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-11 14:04:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:03,626 INFO L225 Difference]: With dead ends: 233 [2024-10-11 14:04:03,626 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 14:04:03,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:04:03,628 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 266 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:03,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 357 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:04:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 14:04:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2024-10-11 14:04:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2024-10-11 14:04:03,640 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 120 [2024-10-11 14:04:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:03,641 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2024-10-11 14:04:03,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2024-10-11 14:04:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 14:04:03,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:03,642 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:04:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:04:03,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 559053122, now seen corresponding path program 1 times [2024-10-11 14:04:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555094626] [2024-10-11 14:04:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:04:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:04:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555094626] [2024-10-11 14:04:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555094626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:04,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:04:04,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437421478] [2024-10-11 14:04:04,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:04,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:04:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:04,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:04:04,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:04:04,347 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:04,726 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2024-10-11 14:04:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:04:04,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-11 14:04:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:04,728 INFO L225 Difference]: With dead ends: 227 [2024-10-11 14:04:04,728 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 14:04:04,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:04:04,729 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 299 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:04,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 248 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:04:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 14:04:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2024-10-11 14:04:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-10-11 14:04:04,742 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 120 [2024-10-11 14:04:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:04,742 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-10-11 14:04:04,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-10-11 14:04:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 14:04:04,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:04,743 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:04:04,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:04:04,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:04,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:04,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1784272085, now seen corresponding path program 1 times [2024-10-11 14:04:04,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:04,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337623162] [2024-10-11 14:04:04,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:04,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat