./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-85.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 b6858d7ad4c18c794513a22d865d2c5f534c26019d86192f01977447e1926b47 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:18:02,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:18:02,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:18:02,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:18:02,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:18:02,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:18:02,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:18:02,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:18:02,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:18:02,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:18:02,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:18:02,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:18:02,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:18:02,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:18:02,155 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:18:02,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:18:02,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:18:02,156 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:18:02,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:18:02,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:18:02,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:18:02,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:18:02,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:18:02,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:18:02,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:18:02,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:18:02,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:18:02,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:18:02,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:18:02,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:18:02,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:18:02,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:18:02,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:18:02,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:18:02,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:18:02,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:18:02,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:18:02,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:18:02,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:18:02,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:18:02,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:18:02,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:18:02,169 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 -> b6858d7ad4c18c794513a22d865d2c5f534c26019d86192f01977447e1926b47 [2024-11-09 02:18:02,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:18:02,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:18:02,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:18:02,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:18:02,471 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:18:02,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-85.i [2024-11-09 02:18:03,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:18:04,201 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:18:04,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-85.i [2024-11-09 02:18:04,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd5cc8b5/3fd42d03a3b34d8fabbb4e1379c8db37/FLAG698af1b69 [2024-11-09 02:18:04,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd5cc8b5/3fd42d03a3b34d8fabbb4e1379c8db37 [2024-11-09 02:18:04,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:18:04,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:18:04,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:18:04,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:18:04,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:18:04,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc2882f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04, skipping insertion in model container [2024-11-09 02:18:04,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:18:04,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-85.i[917,930] [2024-11-09 02:18:04,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:18:04,540 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:18:04,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-85.i[917,930] [2024-11-09 02:18:04,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:18:04,637 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:18:04,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04 WrapperNode [2024-11-09 02:18:04,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:18:04,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:18:04,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:18:04,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:18:04,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,769 INFO L138 Inliner]: procedures = 27, calls = 174, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 530 [2024-11-09 02:18:04,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:18:04,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:18:04,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:18:04,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:18:04,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,817 INFO L175 MemorySlicer]: Split 140 memory accesses to 2 slices as follows [2, 138]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 40 writes are split as follows [0, 40]. [2024-11-09 02:18:04,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:18:04,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:18:04,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:18:04,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:18:04,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:18:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:18:04,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:18:04,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:18:04,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:18:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 02:18:04,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 02:18:04,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 02:18:04,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 02:18:04,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 02:18:04,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 02:18:04,962 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:18:04,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:18:04,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:18:04,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 02:18:04,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:18:04,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:18:05,108 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:18:05,110 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:18:05,734 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-09 02:18:05,734 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:18:05,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:18:05,755 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:18:05,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:18:05 BoogieIcfgContainer [2024-11-09 02:18:05,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:18:05,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:18:05,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:18:05,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:18:05,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:18:04" (1/3) ... [2024-11-09 02:18:05,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5c243e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:18:05, skipping insertion in model container [2024-11-09 02:18:05,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (2/3) ... [2024-11-09 02:18:05,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5c243e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:18:05, skipping insertion in model container [2024-11-09 02:18:05,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:18:05" (3/3) ... [2024-11-09 02:18:05,766 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-85.i [2024-11-09 02:18:05,782 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:18:05,783 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:18:05,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:18:05,864 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;@388f252d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:18:05,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:18:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 105 states have (on average 1.380952380952381) internal successors, (145), 106 states have internal predecessors, (145), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:18:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 02:18:05,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:05,889 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:05,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:05,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash 809731980, now seen corresponding path program 1 times [2024-11-09 02:18:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:05,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983862092] [2024-11-09 02:18:05,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:05,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:18:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:18:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:18:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:18:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:18:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:18:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 02:18:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 02:18:06,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:06,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983862092] [2024-11-09 02:18:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983862092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:06,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:06,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:18:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068082736] [2024-11-09 02:18:06,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:06,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:18:06,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:06,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:18:06,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:18:06,569 INFO L87 Difference]: Start difference. First operand has 131 states, 105 states have (on average 1.380952380952381) internal successors, (145), 106 states have internal predecessors, (145), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 02:18:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:06,613 INFO L93 Difference]: Finished difference Result 255 states and 399 transitions. [2024-11-09 02:18:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:18:06,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2024-11-09 02:18:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:06,623 INFO L225 Difference]: With dead ends: 255 [2024-11-09 02:18:06,623 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 02:18:06,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:18:06,631 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:06,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 02:18:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 02:18:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:18:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2024-11-09 02:18:06,683 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 179 [2024-11-09 02:18:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:06,684 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2024-11-09 02:18:06,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 02:18:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2024-11-09 02:18:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 02:18:06,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:06,689 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:06,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:18:06,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:06,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:06,690 INFO L85 PathProgramCache]: Analyzing trace with hash 949240606, now seen corresponding path program 1 times [2024-11-09 02:18:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:06,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418684792] [2024-11-09 02:18:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:18:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:18:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:18:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:18:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:18:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:18:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 02:18:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 02:18:11,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:11,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418684792] [2024-11-09 02:18:11,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418684792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:11,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:11,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:18:11,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826374529] [2024-11-09 02:18:11,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:11,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:18:11,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:11,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:18:11,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:18:11,802 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-09 02:18:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:12,851 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2024-11-09 02:18:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:18:12,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) Word has length 179 [2024-11-09 02:18:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:12,858 INFO L225 Difference]: With dead ends: 270 [2024-11-09 02:18:12,861 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 02:18:12,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:18:12,863 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 482 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:12,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 579 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:18:12,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 02:18:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2024-11-09 02:18:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:18:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-09 02:18:12,894 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 179 [2024-11-09 02:18:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:12,896 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-09 02:18:12,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-09 02:18:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-09 02:18:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 02:18:12,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:12,899 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:12,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:18:12,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:12,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1951990344, now seen corresponding path program 1 times [2024-11-09 02:18:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:12,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67501352] [2024-11-09 02:18:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:12,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:18:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:18:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:18:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:18:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:18:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:18:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 02:18:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 02:18:13,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:13,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67501352] [2024-11-09 02:18:13,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67501352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:13,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:13,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:18:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615317440] [2024-11-09 02:18:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:13,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:18:13,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:18:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:18:13,924 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 02:18:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:14,388 INFO L93 Difference]: Finished difference Result 329 states and 476 transitions. [2024-11-09 02:18:14,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:18:14,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-09 02:18:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:14,392 INFO L225 Difference]: With dead ends: 329 [2024-11-09 02:18:14,392 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 02:18:14,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:18:14,396 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 250 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:14,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 650 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:18:14,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 02:18:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 147. [2024-11-09 02:18:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.360655737704918) internal successors, (166), 122 states have internal predecessors, (166), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:18:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2024-11-09 02:18:14,429 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 180 [2024-11-09 02:18:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:14,430 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2024-11-09 02:18:14,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 02:18:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2024-11-09 02:18:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 02:18:14,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:14,435 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:14,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:18:14,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:14,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1321908598, now seen corresponding path program 1 times [2024-11-09 02:18:14,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:14,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362847904] [2024-11-09 02:18:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:14,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:18:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:18:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:18:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:18:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:18:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:18:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 02:18:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 02:18:15,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:15,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362847904] [2024-11-09 02:18:15,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362847904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:15,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:15,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:18:15,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128699565] [2024-11-09 02:18:15,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:15,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:18:15,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:15,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:18:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:18:15,733 INFO L87 Difference]: Start difference. First operand 147 states and 212 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 02:18:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:16,388 INFO L93 Difference]: Finished difference Result 372 states and 538 transitions. [2024-11-09 02:18:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:18:16,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-09 02:18:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:16,391 INFO L225 Difference]: With dead ends: 372 [2024-11-09 02:18:16,391 INFO L226 Difference]: Without dead ends: 228 [2024-11-09 02:18:16,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:18:16,395 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 362 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:16,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 589 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:18:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-09 02:18:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 181. [2024-11-09 02:18:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 156 states have internal predecessors, (215), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:18:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 261 transitions. [2024-11-09 02:18:16,428 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 261 transitions. Word has length 180 [2024-11-09 02:18:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:16,428 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 261 transitions. [2024-11-09 02:18:16,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 02:18:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 261 transitions. [2024-11-09 02:18:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 02:18:16,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:16,431 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:16,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:18:16,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:16,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:16,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1630099825, now seen corresponding path program 1 times [2024-11-09 02:18:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:16,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432493394] [2024-11-09 02:18:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:16,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:18:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:18:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:18:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:18:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:18:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:18:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 02:18:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 02:18:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:19,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432493394] [2024-11-09 02:18:19,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432493394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:19,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:19,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 02:18:19,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508689801] [2024-11-09 02:18:19,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:19,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:18:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:18:19,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:18:19,719 INFO L87 Difference]: Start difference. First operand 181 states and 261 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-09 02:18:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:20,628 INFO L93 Difference]: Finished difference Result 404 states and 583 transitions. [2024-11-09 02:18:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:18:20,629 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 180 [2024-11-09 02:18:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:20,631 INFO L225 Difference]: With dead ends: 404 [2024-11-09 02:18:20,631 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 02:18:20,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:18:20,635 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 458 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:20,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 606 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:18:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 02:18:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 183. [2024-11-09 02:18:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 158 states have (on average 1.360759493670886) internal successors, (215), 158 states have internal predecessors, (215), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:18:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 261 transitions. [2024-11-09 02:18:20,671 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 261 transitions. Word has length 180 [2024-11-09 02:18:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:20,671 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 261 transitions. [2024-11-09 02:18:20,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-09 02:18:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 261 transitions. [2024-11-09 02:18:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 02:18:20,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:20,675 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:20,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:18:20,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:20,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1049088925, now seen corresponding path program 1 times [2024-11-09 02:18:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:20,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233408019] [2024-11-09 02:18:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:20,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:18:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:18:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:18:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:18:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:18:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:18:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 02:18:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 02:18:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233408019] [2024-11-09 02:18:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233408019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:21,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:21,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:18:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044265963] [2024-11-09 02:18:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:21,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:18:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:21,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:18:21,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:18:21,310 INFO L87 Difference]: Start difference. First operand 183 states and 261 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 02:18:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:21,708 INFO L93 Difference]: Finished difference Result 403 states and 576 transitions. [2024-11-09 02:18:21,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:18:21,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-09 02:18:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:21,710 INFO L225 Difference]: With dead ends: 403 [2024-11-09 02:18:21,710 INFO L226 Difference]: Without dead ends: 223 [2024-11-09 02:18:21,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:18:21,712 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 291 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:21,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 434 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:18:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-09 02:18:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 176. [2024-11-09 02:18:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 151 states have (on average 1.3576158940397351) internal successors, (205), 151 states have internal predecessors, (205), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:18:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 251 transitions. [2024-11-09 02:18:21,737 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 251 transitions. Word has length 180 [2024-11-09 02:18:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:21,737 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 251 transitions. [2024-11-09 02:18:21,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 02:18:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 251 transitions. [2024-11-09 02:18:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 02:18:21,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:21,740 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:21,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:18:21,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:21,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1370979444, now seen corresponding path program 1 times [2024-11-09 02:18:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725764172] [2024-11-09 02:18:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:18:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:18:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:18:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:18:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:18:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:18:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 02:18:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 02:18:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725764172] [2024-11-09 02:18:23,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725764172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:18:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057265320] [2024-11-09 02:18:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:23,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:18:23,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:18:23,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:18:23,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:18:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:23,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 02:18:23,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:24,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 02:18:24,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:25,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:25,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:26,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:26,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:27,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:27,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:27,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:28,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:28,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:18:28,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:28,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:18:28,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:18:29,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2024-11-09 02:18:29,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:18:29,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2024-11-09 02:18:29,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:18:29,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:18:29,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2024-11-09 02:18:29,257 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-09 02:18:29,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 135 [2024-11-09 02:18:29,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:18:33,163 INFO L349 Elim1Store]: treesize reduction 2390, result has 15.9 percent of original size [2024-11-09 02:18:33,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 19 new quantified variables, introduced 135 case distinctions, treesize of input 363 treesize of output 1053