./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-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db4292ffbdd6738d463d7123be4385279117f56fc7d42e6eafbd16b6955555da --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:00:47,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:00:47,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:00:47,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:00:47,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:00:47,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:00:47,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:00:47,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:00:47,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:00:47,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:00:47,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:00:47,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:00:47,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:00:47,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:00:47,941 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:00:47,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:00:47,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:00:47,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:00:47,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:00:47,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:00:47,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:00:47,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:00:47,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:00:47,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:00:47,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:00:47,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:00:47,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:00:47,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:00:47,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:00:47,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:00:47,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:00:47,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:00:47,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:00:47,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:00:47,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:00:47,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:00:47,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:00:47,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:00:47,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:00:47,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:00:47,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:00:47,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:00:47,956 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db4292ffbdd6738d463d7123be4385279117f56fc7d42e6eafbd16b6955555da [2024-10-24 12:00:48,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:00:48,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:00:48,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:00:48,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:00:48,261 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:00:48,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i [2024-10-24 12:00:49,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:00:49,981 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:00:49,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i [2024-10-24 12:00:49,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df7ae51e/7c8e6916a0f346a38e64ae889a3db199/FLAG47af3200f [2024-10-24 12:00:50,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df7ae51e/7c8e6916a0f346a38e64ae889a3db199 [2024-10-24 12:00:50,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:00:50,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:00:50,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:00:50,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:00:50,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:00:50,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7175d3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50, skipping insertion in model container [2024-10-24 12:00:50,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:00:50,246 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-6.i[916,929] [2024-10-24 12:00:50,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:00:50,380 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:00:50,395 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-6.i[916,929] [2024-10-24 12:00:50,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:00:50,509 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:00:50,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50 WrapperNode [2024-10-24 12:00:50,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:00:50,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:00:50,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:00:50,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:00:50,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,589 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 525 [2024-10-24 12:00:50,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:00:50,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:00:50,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:00:50,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:00:50,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,647 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2024-10-24 12:00:50,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:00:50,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:00:50,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:00:50,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:00:50,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (1/1) ... [2024-10-24 12:00:50,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:00:50,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:00:50,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:00:50,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:00:50,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:00:50,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:00:50,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:00:50,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 12:00:50,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 12:00:50,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 12:00:50,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 12:00:50,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:00:50,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:00:50,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 12:00:50,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 12:00:50,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:00:50,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:00:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:00:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:00:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:00:50,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:00:50,970 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:00:50,973 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:00:51,629 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-24 12:00:51,629 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:00:51,674 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:00:51,675 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:00:51,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:00:51 BoogieIcfgContainer [2024-10-24 12:00:51,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:00:51,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:00:51,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:00:51,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:00:51,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:00:50" (1/3) ... [2024-10-24 12:00:51,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de914e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:00:51, skipping insertion in model container [2024-10-24 12:00:51,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:50" (2/3) ... [2024-10-24 12:00:51,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de914e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:00:51, skipping insertion in model container [2024-10-24 12:00:51,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:00:51" (3/3) ... [2024-10-24 12:00:51,688 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-6.i [2024-10-24 12:00:51,708 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:00:51,709 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:00:51,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:00:51,789 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;@3e2430cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:00:51,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:00:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:00:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:00:51,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:51,816 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:00:51,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:51,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1691815467, now seen corresponding path program 1 times [2024-10-24 12:00:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958122586] [2024-10-24 12:00:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:51,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:00:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:00:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:00:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:00:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:00:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:00:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 12:00:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:00:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958122586] [2024-10-24 12:00:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958122586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:52,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:52,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:00:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687331764] [2024-10-24 12:00:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:52,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:00:52,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:00:52,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:00:52,525 INFO L87 Difference]: Start difference. First operand has 115 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:00:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:52,582 INFO L93 Difference]: Finished difference Result 227 states and 361 transitions. [2024-10-24 12:00:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:00:52,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-10-24 12:00:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:52,593 INFO L225 Difference]: With dead ends: 227 [2024-10-24 12:00:52,593 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 12:00:52,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-24 12:00:52,600 INFO L432 NwaCegarLoop]: 163 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, 163 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-24 12:00:52,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 12:00:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 12:00:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:00:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2024-10-24 12:00:52,654 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 153 [2024-10-24 12:00:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:52,655 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2024-10-24 12:00:52,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:00:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2024-10-24 12:00:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:00:52,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:52,660 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:00:52,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:00:52,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:52,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:52,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1540379977, now seen corresponding path program 1 times [2024-10-24 12:00:52,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:52,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865908137] [2024-10-24 12:00:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:52,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:00:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:00:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:00:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:00:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:00:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:00:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 12:00:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:00:53,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:53,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865908137] [2024-10-24 12:00:53,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865908137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:53,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:53,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:53,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971800028] [2024-10-24 12:00:53,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:53,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:53,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:53,181 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:00:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:53,261 INFO L93 Difference]: Finished difference Result 227 states and 336 transitions. [2024-10-24 12:00:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-10-24 12:00:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:53,265 INFO L225 Difference]: With dead ends: 227 [2024-10-24 12:00:53,265 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 12:00:53,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-24 12:00:53,269 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:53,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 476 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 12:00:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 12:00:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:00:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-10-24 12:00:53,292 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 153 [2024-10-24 12:00:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:53,293 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-10-24 12:00:53,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:00:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-10-24 12:00:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:00:53,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:53,296 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:00:53,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:00:53,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:53,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash -357116789, now seen corresponding path program 1 times [2024-10-24 12:00:53,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:53,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863425800] [2024-10-24 12:00:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:00:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:00:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:00:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:00:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:00:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:00:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 12:00:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:00:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:53,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863425800] [2024-10-24 12:00:53,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863425800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:53,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:53,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:00:53,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652294857] [2024-10-24 12:00:53,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:53,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:00:53,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:00:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:00:53,623 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 12:00:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:53,674 INFO L93 Difference]: Finished difference Result 229 states and 337 transitions. [2024-10-24 12:00:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:00:53,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-10-24 12:00:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:53,677 INFO L225 Difference]: With dead ends: 229 [2024-10-24 12:00:53,677 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 12:00:53,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:00:53,679 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:53,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 12:00:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 12:00:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:00:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-10-24 12:00:53,700 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 153 [2024-10-24 12:00:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:53,700 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-10-24 12:00:53,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 12:00:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-10-24 12:00:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:00:53,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:53,707 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:00:53,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:00:53,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:53,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1943705801, now seen corresponding path program 1 times [2024-10-24 12:00:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:53,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368400221] [2024-10-24 12:00:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:00:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:00:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:00:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:00:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:00:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:00:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 12:00:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:00:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:54,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368400221] [2024-10-24 12:00:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368400221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:54,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831922793] [2024-10-24 12:00:54,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:54,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:54,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:54,078 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 12:00:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:54,130 INFO L93 Difference]: Finished difference Result 231 states and 338 transitions. [2024-10-24 12:00:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:54,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-10-24 12:00:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:54,135 INFO L225 Difference]: With dead ends: 231 [2024-10-24 12:00:54,135 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 12:00:54,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-24 12:00:54,137 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:54,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 12:00:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-24 12:00:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:00:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-10-24 12:00:54,149 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 153 [2024-10-24 12:00:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:54,150 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-10-24 12:00:54,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 12:00:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-10-24 12:00:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 12:00:54,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:54,153 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:00:54,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:00:54,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:54,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash -628605865, now seen corresponding path program 1 times [2024-10-24 12:00:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:54,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680308409] [2024-10-24 12:00:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:00:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:00:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:00:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:00:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:00:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:00:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 12:00:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:00:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:54,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680308409] [2024-10-24 12:00:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680308409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:54,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:54,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782668516] [2024-10-24 12:00:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:54,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:54,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:54,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:54,607 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 12:00:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:54,725 INFO L93 Difference]: Finished difference Result 233 states and 339 transitions. [2024-10-24 12:00:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-10-24 12:00:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:54,729 INFO L225 Difference]: With dead ends: 233 [2024-10-24 12:00:54,729 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 12:00:54,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-24 12:00:54,731 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:54,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:00:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 12:00:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-24 12:00:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:00:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-10-24 12:00:54,751 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 155 [2024-10-24 12:00:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:54,754 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-10-24 12:00:54,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 12:00:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-10-24 12:00:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 12:00:54,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:54,756 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:00:54,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:00:54,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:54,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1649674219, now seen corresponding path program 1 times [2024-10-24 12:00:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753900960] [2024-10-24 12:00:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:00:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:00:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:00:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:00:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:00:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:00:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 12:00:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:00:56,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753900960] [2024-10-24 12:00:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753900960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:00:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371840951] [2024-10-24 12:00:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:56,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:00:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:00:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:00:56,983 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:00:57,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:57,660 INFO L93 Difference]: Finished difference Result 286 states and 411 transitions. [2024-10-24 12:00:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:00:57,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-10-24 12:00:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:57,664 INFO L225 Difference]: With dead ends: 286 [2024-10-24 12:00:57,666 INFO L226 Difference]: Without dead ends: 170 [2024-10-24 12:00:57,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:00:57,669 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 300 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:57,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 500 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:00:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-24 12:00:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 140. [2024-10-24 12:00:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 119 states have (on average 1.361344537815126) internal successors, (162), 119 states have internal predecessors, (162), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:00:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2024-10-24 12:00:57,700 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 155 [2024-10-24 12:00:57,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:57,701 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2024-10-24 12:00:57,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:00:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2024-10-24 12:00:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 12:00:57,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:57,706 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:00:57,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:00:57,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:57,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash 253664718, now seen corresponding path program 1 times [2024-10-24 12:00:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:57,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119568514] [2024-10-24 12:00:57,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat