./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-31.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 86d647ec7a81d0bdbb105f00a2f8baf20d2b0ea117dcb47d88d4f39ade918712 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:08:35,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:08:35,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:08:35,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:08:35,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:08:35,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:08:35,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:08:35,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:08:35,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:08:35,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:08:35,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:08:35,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:08:35,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:08:35,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:08:35,428 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:08:35,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:08:35,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:08:35,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:08:35,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:08:35,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:08:35,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:08:35,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:08:35,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:08:35,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:08:35,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:08:35,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:08:35,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:08:35,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:08:35,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:08:35,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:08:35,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:08:35,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:08:35,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:08:35,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:08:35,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:08:35,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:08:35,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:08:35,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:08:35,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:08:35,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:08:35,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:08:35,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:08:35,436 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 -> 86d647ec7a81d0bdbb105f00a2f8baf20d2b0ea117dcb47d88d4f39ade918712 [2024-11-08 21:08:35,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:08:35,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:08:35,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:08:35,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:08:35,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:08:35,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-31.i [2024-11-08 21:08:37,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:08:37,467 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:08:37,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-31.i [2024-11-08 21:08:37,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928005843/80ceab89feb94dd28ae1d8e0d20e8134/FLAG762e4ba59 [2024-11-08 21:08:37,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928005843/80ceab89feb94dd28ae1d8e0d20e8134 [2024-11-08 21:08:37,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:08:37,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:08:37,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:08:37,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:08:37,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:08:37,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:08:37" (1/1) ... [2024-11-08 21:08:37,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31466672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:37, skipping insertion in model container [2024-11-08 21:08:37,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:08:37" (1/1) ... [2024-11-08 21:08:37,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:08:38,037 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_fillercode_fillercodestructure_filler-pe-ci_file-31.i[919,932] [2024-11-08 21:08:38,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:08:38,180 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:08:38,223 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_fillercode_fillercodestructure_filler-pe-ci_file-31.i[919,932] [2024-11-08 21:08:38,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:08:38,377 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:08:38,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38 WrapperNode [2024-11-08 21:08:38,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:08:38,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:08:38,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:08:38,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:08:38,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,441 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-08 21:08:38,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:08:38,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:08:38,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:08:38,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:08:38,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,511 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-08 21:08:38,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:08:38,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:08:38,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:08:38,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:08:38,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:08:38,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:08:38,609 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-08 21:08:38,613 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-08 21:08:38,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:08:38,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:08:38,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:08:38,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:08:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:08:38,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:08:38,755 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:08:38,757 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:08:39,260 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 21:08:39,262 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:08:39,279 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:08:39,280 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:08:39,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:08:39 BoogieIcfgContainer [2024-11-08 21:08:39,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:08:39,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:08:39,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:08:39,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:08:39,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:08:37" (1/3) ... [2024-11-08 21:08:39,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6add9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:08:39, skipping insertion in model container [2024-11-08 21:08:39,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (2/3) ... [2024-11-08 21:08:39,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6add9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:08:39, skipping insertion in model container [2024-11-08 21:08:39,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:08:39" (3/3) ... [2024-11-08 21:08:39,290 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-31.i [2024-11-08 21:08:39,309 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:08:39,309 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:08:39,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:08:39,402 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;@5391701e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:08:39,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:08:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:08:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 21:08:39,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:39,427 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:08:39,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:39,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1477446620, now seen corresponding path program 1 times [2024-11-08 21:08:39,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555135665] [2024-11-08 21:08:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:08:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:08:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:08:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:08:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:08:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:08:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:08:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:08:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:08:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:08:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 21:08:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:08:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:08:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:08:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:08:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:08:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:08:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:08:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:08:40,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:40,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555135665] [2024-11-08 21:08:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555135665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:40,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:40,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:08:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908199147] [2024-11-08 21:08:40,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:40,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:08:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:40,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:08:40,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:08:40,157 INFO L87 Difference]: Start difference. First operand has 92 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:08:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:40,193 INFO L93 Difference]: Finished difference Result 177 states and 313 transitions. [2024-11-08 21:08:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:08:40,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 186 [2024-11-08 21:08:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:40,208 INFO L225 Difference]: With dead ends: 177 [2024-11-08 21:08:40,208 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 21:08:40,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-08 21:08:40,215 INFO L432 NwaCegarLoop]: 138 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, 138 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-08 21:08:40,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:08:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 21:08:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-08 21:08:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:08:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2024-11-08 21:08:40,288 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 186 [2024-11-08 21:08:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:40,289 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2024-11-08 21:08:40,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:08:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2024-11-08 21:08:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 21:08:40,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:40,296 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:08:40,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:08:40,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:40,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1752136038, now seen corresponding path program 1 times [2024-11-08 21:08:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:40,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903758475] [2024-11-08 21:08:40,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:40,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:08:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:08:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:08:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:08:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:08:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:08:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:08:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:08:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:08:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:08:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 21:08:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:08:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:08:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:08:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:08:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:08:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:08:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:08:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:08:40,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:40,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903758475] [2024-11-08 21:08:40,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903758475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:40,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:40,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:08:40,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730752683] [2024-11-08 21:08:40,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:40,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:08:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:08:40,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:08:40,764 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:08:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:40,834 INFO L93 Difference]: Finished difference Result 257 states and 406 transitions. [2024-11-08 21:08:40,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:08:40,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 186 [2024-11-08 21:08:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:40,838 INFO L225 Difference]: With dead ends: 257 [2024-11-08 21:08:40,839 INFO L226 Difference]: Without dead ends: 172 [2024-11-08 21:08:40,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:08:40,841 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 126 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:40,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 386 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:08:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-08 21:08:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 92. [2024-11-08 21:08:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:08:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2024-11-08 21:08:40,861 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 143 transitions. Word has length 186 [2024-11-08 21:08:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:40,863 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 143 transitions. [2024-11-08 21:08:40,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:08:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 143 transitions. [2024-11-08 21:08:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 21:08:40,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:40,872 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:08:40,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:08:40,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:40,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash 731067684, now seen corresponding path program 1 times [2024-11-08 21:08:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:40,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864412838] [2024-11-08 21:08:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:40,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:08:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:08:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:08:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:08:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:08:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:08:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:08:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:08:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:08:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:08:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 21:08:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:08:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:08:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:08:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:08:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:08:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:08:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:08:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:08:53,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864412838] [2024-11-08 21:08:53,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864412838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:53,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:53,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 21:08:53,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106953329] [2024-11-08 21:08:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:53,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 21:08:53,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:53,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 21:08:53,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:08:53,517 INFO L87 Difference]: Start difference. First operand 92 states and 143 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:08:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:57,018 INFO L93 Difference]: Finished difference Result 292 states and 435 transitions. [2024-11-08 21:08:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 21:08:57,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 186 [2024-11-08 21:08:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:57,022 INFO L225 Difference]: With dead ends: 292 [2024-11-08 21:08:57,022 INFO L226 Difference]: Without dead ends: 290 [2024-11-08 21:08:57,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2024-11-08 21:08:57,024 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 648 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:57,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 693 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 21:08:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-08 21:08:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 173. [2024-11-08 21:08:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 135 states have internal predecessors, (196), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 21:08:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2024-11-08 21:08:57,055 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 186 [2024-11-08 21:08:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:57,057 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2024-11-08 21:08:57,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:08:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2024-11-08 21:08:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 21:08:57,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:57,064 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:08:57,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:08:57,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:57,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1788892250, now seen corresponding path program 1 times [2024-11-08 21:08:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061015852] [2024-11-08 21:08:57,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:09:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:09:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:09:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:09:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:09:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:09:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:09:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:09:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:09:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:09:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:09:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:09:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:09:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:09:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:09:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:09:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:09:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:09:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:09:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:09:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:09:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 21:09:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:09:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:09:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:09:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:09:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:09:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:09:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:09:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:09:02,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:09:02,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061015852] [2024-11-08 21:09:02,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061015852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:09:02,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:09:02,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 21:09:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349651429] [2024-11-08 21:09:02,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:09:02,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 21:09:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:09:02,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 21:09:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-08 21:09:02,298 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:09:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:09:04,181 INFO L93 Difference]: Finished difference Result 474 states and 715 transitions. [2024-11-08 21:09:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 21:09:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 186 [2024-11-08 21:09:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:09:04,186 INFO L225 Difference]: With dead ends: 474 [2024-11-08 21:09:04,186 INFO L226 Difference]: Without dead ends: 311 [2024-11-08 21:09:04,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:09:04,188 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 402 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:09:04,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 638 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 21:09:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-08 21:09:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 171. [2024-11-08 21:09:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.465648854961832) internal successors, (192), 133 states have internal predecessors, (192), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 21:09:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2024-11-08 21:09:04,213 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 186 [2024-11-08 21:09:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:09:04,214 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2024-11-08 21:09:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:09:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2024-11-08 21:09:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 21:09:04,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:09:04,217 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:09:04,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:09:04,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:09:04,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:09:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash -478390834, now seen corresponding path program 1 times [2024-11-08 21:09:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:09:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615898582] [2024-11-08 21:09:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:09:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:09:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat