./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-66.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 2b1ff31db509e6effa7c7aab233d1c51ba648bc5079bf259c615627714f8cf03 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:42:08,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:42:08,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:42:08,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:42:08,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:42:08,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:42:08,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:42:08,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:42:08,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:42:08,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:42:08,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:42:08,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:42:08,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:42:08,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:42:08,349 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:42:08,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:42:08,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:42:08,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:42:08,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:42:08,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:42:08,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:42:08,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:42:08,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:42:08,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:42:08,353 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:42:08,353 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:42:08,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:42:08,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:42:08,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:42:08,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:42:08,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:42:08,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:42:08,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:42:08,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:42:08,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:42:08,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:42:08,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:42:08,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:42:08,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:42:08,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:42:08,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:42:08,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:42:08,359 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 -> 2b1ff31db509e6effa7c7aab233d1c51ba648bc5079bf259c615627714f8cf03 [2024-11-20 02:42:08,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:42:08,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:42:08,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:42:08,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:42:08,647 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:42:08,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-66.i [2024-11-20 02:42:10,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:42:10,213 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:42:10,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-66.i [2024-11-20 02:42:10,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36cffcb5c/0e029ca8cf8f414bad0ecab9c44c6f2e/FLAG12de1e91c [2024-11-20 02:42:10,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36cffcb5c/0e029ca8cf8f414bad0ecab9c44c6f2e [2024-11-20 02:42:10,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:42:10,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:42:10,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:42:10,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:42:10,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:42:10,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:10,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f3e6e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10, skipping insertion in model container [2024-11-20 02:42:10,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:10,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:42:10,786 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_codestructure_steplocals_file-66.i[917,930] [2024-11-20 02:42:10,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:42:10,851 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:42:10,862 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_codestructure_steplocals_file-66.i[917,930] [2024-11-20 02:42:10,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:42:10,905 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:42:10,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10 WrapperNode [2024-11-20 02:42:10,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:42:10,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:42:10,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:42:10,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:42:10,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:10,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:10,955 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-11-20 02:42:10,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:42:10,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:42:10,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:42:10,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:42:10,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:10,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:10,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:11,026 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:42:11,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:11,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:11,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:11,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:11,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:11,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:11,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:42:11,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:42:11,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:42:11,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:42:11,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:11,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:42:11,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:42:11,097 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-20 02:42:11,104 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-20 02:42:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:42:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:42:11,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:42:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:42:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:42:11,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:42:11,235 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:42:11,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:42:11,592 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 02:42:11,592 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:42:11,606 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:42:11,606 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:42:11,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:42:11 BoogieIcfgContainer [2024-11-20 02:42:11,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:42:11,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:42:11,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:42:11,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:42:11,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:42:10" (1/3) ... [2024-11-20 02:42:11,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75afee64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:42:11, skipping insertion in model container [2024-11-20 02:42:11,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10" (2/3) ... [2024-11-20 02:42:11,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75afee64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:42:11, skipping insertion in model container [2024-11-20 02:42:11,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:42:11" (3/3) ... [2024-11-20 02:42:11,615 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-66.i [2024-11-20 02:42:11,631 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:42:11,631 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:42:11,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:42:11,691 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;@5199379c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:42:11,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:42:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:42:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-20 02:42:11,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:11,710 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:42:11,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:11,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1657202567, now seen corresponding path program 1 times [2024-11-20 02:42:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:42:11,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397794344] [2024-11-20 02:42:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:42:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:42:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:42:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:42:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:42:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:42:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:42:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:42:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:42:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:42:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:42:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:42:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:42:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:42:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:42:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:42:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:42:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:42:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:42:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:42:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:42:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:42:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:42:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:42:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:42:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:42:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:42:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 02:42:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:42:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397794344] [2024-11-20 02:42:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397794344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:42:12,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:42:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:42:12,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626962235] [2024-11-20 02:42:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:42:12,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:42:12,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:42:12,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:42:12,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:42:12,281 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:42:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:12,322 INFO L93 Difference]: Finished difference Result 141 states and 248 transitions. [2024-11-20 02:42:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:42:12,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-11-20 02:42:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:12,333 INFO L225 Difference]: With dead ends: 141 [2024-11-20 02:42:12,333 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 02:42:12,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-20 02:42:12,342 INFO L432 NwaCegarLoop]: 107 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, 107 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-20 02:42:12,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:42:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 02:42:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 02:42:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:42:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2024-11-20 02:42:12,455 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 164 [2024-11-20 02:42:12,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:12,456 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2024-11-20 02:42:12,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:42:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2024-11-20 02:42:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-20 02:42:12,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:12,499 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:42:12,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:42:12,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:12,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1173335865, now seen corresponding path program 1 times [2024-11-20 02:42:12,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:42:12,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535298798] [2024-11-20 02:42:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:12,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:42:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:42:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:42:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:42:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:42:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:42:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:42:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:42:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:42:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:42:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:42:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:42:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:42:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:42:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:42:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:42:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:42:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:42:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:42:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:42:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:42:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:42:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:42:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:42:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:42:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:42:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:42:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 02:42:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:42:28,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535298798] [2024-11-20 02:42:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535298798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:42:28,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:42:28,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 02:42:28,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995132469] [2024-11-20 02:42:28,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:42:28,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:42:28,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:42:28,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:42:28,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:42:28,775 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 02:42:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:30,288 INFO L93 Difference]: Finished difference Result 214 states and 295 transitions. [2024-11-20 02:42:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:42:30,289 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-11-20 02:42:30,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:30,294 INFO L225 Difference]: With dead ends: 214 [2024-11-20 02:42:30,294 INFO L226 Difference]: Without dead ends: 212 [2024-11-20 02:42:30,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:42:30,295 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 210 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 02:42:30,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 719 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 02:42:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-20 02:42:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 112. [2024-11-20 02:42:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:42:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-11-20 02:42:30,333 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 164 [2024-11-20 02:42:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:30,335 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-11-20 02:42:30,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 02:42:30,336 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-11-20 02:42:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-20 02:42:30,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:30,341 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:42:30,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:42:30,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:30,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash 363989239, now seen corresponding path program 1 times [2024-11-20 02:42:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:42:30,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606126678] [2024-11-20 02:42:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:42:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:42:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:42:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:42:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:42:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:42:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:42:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:42:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:42:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:42:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:42:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:42:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:42:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:42:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:42:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:42:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:42:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:42:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:42:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:42:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:42:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:42:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:42:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:42:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:42:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:42:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:42:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 02:42:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:42:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606126678] [2024-11-20 02:42:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606126678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:42:43,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:42:43,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 02:42:43,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865927707] [2024-11-20 02:42:43,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:42:43,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:42:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:42:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:42:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:42:43,921 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 02:42:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:45,386 INFO L93 Difference]: Finished difference Result 202 states and 282 transitions. [2024-11-20 02:42:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:42:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-11-20 02:42:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:45,389 INFO L225 Difference]: With dead ends: 202 [2024-11-20 02:42:45,390 INFO L226 Difference]: Without dead ends: 200 [2024-11-20 02:42:45,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:42:45,391 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 187 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 02:42:45,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 654 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 02:42:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-20 02:42:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 112. [2024-11-20 02:42:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:42:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-11-20 02:42:45,420 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 164 [2024-11-20 02:42:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:45,421 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-11-20 02:42:45,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 02:42:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-11-20 02:42:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-20 02:42:45,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:45,424 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:42:45,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:42:45,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:45,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1874400443, now seen corresponding path program 1 times [2024-11-20 02:42:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:42:45,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127167051] [2024-11-20 02:42:45,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:45,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:42:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:42:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:42:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:42:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:42:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:42:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:42:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:42:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:42:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:42:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:42:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:42:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:42:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:42:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:42:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:42:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:42:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:42:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:42:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:42:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:42:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:42:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:42:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:42:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:42:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:42:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:42:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 02:42:45,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:42:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127167051] [2024-11-20 02:42:45,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127167051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:42:45,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:42:45,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:42:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483352197] [2024-11-20 02:42:45,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:42:45,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:42:45,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:42:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:42:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:42:45,850 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:42:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:46,146 INFO L93 Difference]: Finished difference Result 277 states and 416 transitions. [2024-11-20 02:42:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:42:46,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-11-20 02:42:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:46,150 INFO L225 Difference]: With dead ends: 277 [2024-11-20 02:42:46,150 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 02:42:46,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:42:46,156 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 127 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:42:46,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 199 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:42:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 02:42:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-11-20 02:42:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 125 states have internal predecessors, (168), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 02:42:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2024-11-20 02:42:46,208 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 164 [2024-11-20 02:42:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:46,209 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2024-11-20 02:42:46,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:42:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2024-11-20 02:42:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-20 02:42:46,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:46,215 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:42:46,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:42:46,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:46,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:46,216 INFO L85 PathProgramCache]: Analyzing trace with hash 152267511, now seen corresponding path program 1 times [2024-11-20 02:42:46,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:42:46,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213294935] [2024-11-20 02:42:46,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:46,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:42:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:42:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:42:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:42:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:42:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:42:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:42:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:42:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:42:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:42:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:42:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:42:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:42:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:42:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:42:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:42:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:42:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:42:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:42:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:42:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:42:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:42:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:42:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:42:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:42:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:42:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:42:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 02:42:46,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:42:46,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213294935] [2024-11-20 02:42:46,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213294935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:42:46,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:42:46,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:42:46,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777909918] [2024-11-20 02:42:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:42:46,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:42:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:42:46,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:42:46,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:42:46,411 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 02:42:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:46,572 INFO L93 Difference]: Finished difference Result 475 states and 701 transitions. [2024-11-20 02:42:46,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:42:46,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-11-20 02:42:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:46,575 INFO L225 Difference]: With dead ends: 475 [2024-11-20 02:42:46,576 INFO L226 Difference]: Without dead ends: 313 [2024-11-20 02:42:46,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:42:46,577 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 87 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:42:46,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 432 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:42:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-20 02:42:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2024-11-20 02:42:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 220 states have internal predecessors, (286), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 02:42:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 454 transitions. [2024-11-20 02:42:46,628 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 454 transitions. Word has length 164 [2024-11-20 02:42:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:46,629 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 454 transitions. [2024-11-20 02:42:46,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 02:42:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 454 transitions. [2024-11-20 02:42:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-20 02:42:46,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:46,633 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:42:46,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:42:46,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:46,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash 209525813, now seen corresponding path program 1 times [2024-11-20 02:42:46,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:42:46,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987743646] [2024-11-20 02:42:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:42:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:43:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:43:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:43:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:43:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:43:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:43:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:43:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:43:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:43:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:43:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:43:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:43:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:43:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:43:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:43:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:43:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:43:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:43:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:43:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:43:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:43:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:43:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:43:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:43:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:43:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:43:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:43:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 02:43:11,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:43:11,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987743646] [2024-11-20 02:43:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987743646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:43:11,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:43:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 02:43:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271518030] [2024-11-20 02:43:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:43:11,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:43:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:43:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:43:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:43:11,112 INFO L87 Difference]: Start difference. First operand 307 states and 454 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:43:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:43:17,168 INFO L93 Difference]: Finished difference Result 383 states and 550 transitions. [2024-11-20 02:43:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 02:43:17,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-11-20 02:43:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:43:17,174 INFO L225 Difference]: With dead ends: 383 [2024-11-20 02:43:17,174 INFO L226 Difference]: Without dead ends: 381 [2024-11-20 02:43:17,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-11-20 02:43:17,176 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 258 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:43:17,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 666 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 02:43:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-20 02:43:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 320. [2024-11-20 02:43:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 227 states have (on average 1.3348017621145374) internal successors, (303), 233 states have internal predecessors, (303), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 02:43:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 471 transitions. [2024-11-20 02:43:17,242 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 471 transitions. Word has length 164 [2024-11-20 02:43:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:43:17,242 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 471 transitions. [2024-11-20 02:43:17,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 02:43:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 471 transitions. [2024-11-20 02:43:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-20 02:43:17,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:43:17,245 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:43:17,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:43:17,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:43:17,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:43:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash -599820813, now seen corresponding path program 1 times [2024-11-20 02:43:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:43:17,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878851636] [2024-11-20 02:43:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:43:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:43:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat