./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_floatingpointinfluence_no-floats_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_floatingpointinfluence_no-floats_file-90.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 5c581b69fd672134ca994dfa5a3ffe1c4c6d7d4efa55ea6e444f7b9681e450b7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:41:41,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:41:41,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:41:41,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:41:41,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:41:41,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:41:41,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:41:41,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:41:41,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:41:41,469 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:41:41,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:41:41,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:41:41,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:41:41,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:41:41,471 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:41:41,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:41:41,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:41:41,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:41:41,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:41:41,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:41:41,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:41:41,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:41:41,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:41:41,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:41:41,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:41:41,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:41:41,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:41:41,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:41:41,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:41:41,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:41:41,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:41:41,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:41:41,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:41:41,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:41:41,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:41:41,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:41:41,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:41:41,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:41:41,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:41:41,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:41:41,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:41:41,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:41:41,482 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 -> 5c581b69fd672134ca994dfa5a3ffe1c4c6d7d4efa55ea6e444f7b9681e450b7 [2024-10-13 03:41:41,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:41:41,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:41:41,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:41:41,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:41:41,704 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:41:41,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i [2024-10-13 03:41:42,907 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:41:43,096 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:41:43,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i [2024-10-13 03:41:43,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555b5cdcc/b2444d964ff9430489db4ffed88171d1/FLAGb0566d080 [2024-10-13 03:41:43,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555b5cdcc/b2444d964ff9430489db4ffed88171d1 [2024-10-13 03:41:43,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:41:43,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:41:43,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:43,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:41:43,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:41:43,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8b3541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43, skipping insertion in model container [2024-10-13 03:41:43,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:41:43,681 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i[916,929] [2024-10-13 03:41:43,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:43,723 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:41:43,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i[916,929] [2024-10-13 03:41:43,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:43,770 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:41:43,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43 WrapperNode [2024-10-13 03:41:43,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:43,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:43,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:41:43,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:41:43,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,804 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-13 03:41:43,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:43,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:41:43,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:41:43,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:41:43,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,833 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-10-13 03:41:43,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:41:43,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:41:43,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:41:43,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:41:43,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (1/1) ... [2024-10-13 03:41:43,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:41:43,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:41:43,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:41:43,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:41:43,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:41:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:41:43,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:41:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:41:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:41:43,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:41:44,011 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:41:44,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:41:44,257 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:41:44,258 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:41:44,305 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:41:44,306 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:41:44,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:41:44 BoogieIcfgContainer [2024-10-13 03:41:44,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:41:44,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:41:44,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:41:44,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:41:44,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:41:43" (1/3) ... [2024-10-13 03:41:44,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2c2ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:41:44, skipping insertion in model container [2024-10-13 03:41:44,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:43" (2/3) ... [2024-10-13 03:41:44,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2c2ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:41:44, skipping insertion in model container [2024-10-13 03:41:44,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:41:44" (3/3) ... [2024-10-13 03:41:44,315 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-90.i [2024-10-13 03:41:44,331 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:41:44,331 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:41:44,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:41:44,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;@36b09b7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:41:44,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:41:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:41:44,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:41:44,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:44,418 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:44,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:44,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:44,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1356584365, now seen corresponding path program 1 times [2024-10-13 03:41:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:44,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392706419] [2024-10-13 03:41:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:41:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:41:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:41:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:41:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:41:44,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392706419] [2024-10-13 03:41:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392706419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:44,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:44,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:41:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044994076] [2024-10-13 03:41:44,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:44,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:41:44,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:41:44,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:41:44,803 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:41:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:44,839 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2024-10-13 03:41:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:41:44,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2024-10-13 03:41:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:44,848 INFO L225 Difference]: With dead ends: 99 [2024-10-13 03:41:44,848 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 03:41:44,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:41:44,856 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:44,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:41:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 03:41:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-13 03:41:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:41:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2024-10-13 03:41:44,898 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 120 [2024-10-13 03:41:44,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:44,900 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2024-10-13 03:41:44,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:41:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2024-10-13 03:41:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:41:44,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:44,904 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:44,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:41:44,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:44,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash -997376595, now seen corresponding path program 1 times [2024-10-13 03:41:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125933290] [2024-10-13 03:41:44,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:44,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:41:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:41:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:41:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:41:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:41:48,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:48,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125933290] [2024-10-13 03:41:48,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125933290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:48,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:48,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:41:48,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251176475] [2024-10-13 03:41:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:48,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:41:48,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:48,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:41:48,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:41:48,210 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:48,900 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2024-10-13 03:41:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:41:48,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2024-10-13 03:41:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:48,904 INFO L225 Difference]: With dead ends: 96 [2024-10-13 03:41:48,904 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 03:41:48,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:41:48,905 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 119 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:48,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 305 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:41:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 03:41:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2024-10-13 03:41:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:41:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-10-13 03:41:48,933 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2024-10-13 03:41:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:48,935 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-10-13 03:41:48,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-10-13 03:41:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:41:48,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:48,938 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:48,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:41:48,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:48,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash -997317013, now seen corresponding path program 1 times [2024-10-13 03:41:48,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:48,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347876078] [2024-10-13 03:41:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:48,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:41:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:41:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:41:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:41:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:41:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347876078] [2024-10-13 03:41:50,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347876078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:50,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:50,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:41:50,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76007862] [2024-10-13 03:41:50,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:50,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:41:50,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:50,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:41:50,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:41:50,631 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:41:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:51,217 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2024-10-13 03:41:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:41:51,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2024-10-13 03:41:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:51,218 INFO L225 Difference]: With dead ends: 93 [2024-10-13 03:41:51,218 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 03:41:51,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:41:51,220 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 134 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:51,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 218 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:41:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 03:41:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2024-10-13 03:41:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:41:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-10-13 03:41:51,240 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2024-10-13 03:41:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:51,241 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-10-13 03:41:51,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:41:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-10-13 03:41:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:41:51,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:51,243 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:41:51,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:51,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1054634897, now seen corresponding path program 1 times [2024-10-13 03:41:51,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337997834] [2024-10-13 03:41:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:41:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:41:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:41:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:41:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:41:53,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:53,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337997834] [2024-10-13 03:41:53,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337997834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:53,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:41:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892563826] [2024-10-13 03:41:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:53,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:41:53,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:53,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:41:53,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:41:53,035 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:53,458 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2024-10-13 03:41:53,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:41:53,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2024-10-13 03:41:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:53,461 INFO L225 Difference]: With dead ends: 123 [2024-10-13 03:41:53,461 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 03:41:53,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:41:53,462 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 84 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:53,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 250 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:41:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 03:41:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2024-10-13 03:41:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 03:41:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2024-10-13 03:41:53,486 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 120 [2024-10-13 03:41:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:53,487 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2024-10-13 03:41:53,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2024-10-13 03:41:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:41:53,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:53,488 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:53,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:41:53,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:53,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1054575315, now seen corresponding path program 1 times [2024-10-13 03:41:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608623330] [2024-10-13 03:41:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:41:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:41:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:41:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:41:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:41:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608623330] [2024-10-13 03:41:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608623330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:41:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660620972] [2024-10-13 03:41:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:54,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:41:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:41:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:41:54,512 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:54,853 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2024-10-13 03:41:54,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:41:54,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2024-10-13 03:41:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:54,855 INFO L225 Difference]: With dead ends: 115 [2024-10-13 03:41:54,855 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 03:41:54,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:41:54,856 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 77 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:54,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 318 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:41:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 03:41:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-10-13 03:41:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 60 states have internal predecessors, (69), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 03:41:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-10-13 03:41:54,878 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 120 [2024-10-13 03:41:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:54,879 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-10-13 03:41:54,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-10-13 03:41:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:41:54,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:54,881 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:54,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:41:54,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:54,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1148591013, now seen corresponding path program 1 times [2024-10-13 03:41:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:54,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565555983] [2024-10-13 03:41:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:54,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:41:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:41:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:41:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:41:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:41:56,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:56,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565555983] [2024-10-13 03:41:56,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565555983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:56,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:56,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:41:56,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412794664] [2024-10-13 03:41:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:56,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:41:56,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:41:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:41:56,730 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:57,439 INFO L93 Difference]: Finished difference Result 154 states and 207 transitions. [2024-10-13 03:41:57,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 03:41:57,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:41:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:57,441 INFO L225 Difference]: With dead ends: 154 [2024-10-13 03:41:57,441 INFO L226 Difference]: Without dead ends: 152 [2024-10-13 03:41:57,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:41:57,442 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 150 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:57,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 300 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:41:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-13 03:41:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 65. [2024-10-13 03:41:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:41:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-10-13 03:41:57,459 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 121 [2024-10-13 03:41:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:57,459 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-10-13 03:41:57,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-10-13 03:41:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:41:57,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:57,460 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:57,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:41:57,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1148650595, now seen corresponding path program 1 times [2024-10-13 03:41:57,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:57,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186539745] [2024-10-13 03:41:57,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:57,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:41:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:41:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:41:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:41:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:41:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186539745] [2024-10-13 03:41:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186539745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:41:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73573458] [2024-10-13 03:41:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:41:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:58,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:41:58,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:41:58,688 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:59,395 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2024-10-13 03:41:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 03:41:59,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:41:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:59,397 INFO L225 Difference]: With dead ends: 135 [2024-10-13 03:41:59,397 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 03:41:59,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:41:59,398 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 133 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:59,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 326 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:41:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 03:41:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 65. [2024-10-13 03:41:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:41:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-10-13 03:41:59,410 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 121 [2024-10-13 03:41:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:59,410 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-10-13 03:41:59,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:41:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-10-13 03:41:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:41:59,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:59,411 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:59,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:41:59,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:59,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1091392293, now seen corresponding path program 1 times [2024-10-13 03:41:59,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:59,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107057475] [2024-10-13 03:41:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:42:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:42:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:42:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:42:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:42:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:42:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:42:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:42:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:42:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:42:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:42:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:42:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:42:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:42:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:42:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:42:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:42:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:42:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:42:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:42:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:42:00,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:42:00,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107057475] [2024-10-13 03:42:00,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107057475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:42:00,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:42:00,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:42:00,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560155221] [2024-10-13 03:42:00,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:42:00,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:42:00,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:42:00,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:42:00,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:42:00,328 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:42:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:42:01,031 INFO L93 Difference]: Finished difference Result 126 states and 171 transitions. [2024-10-13 03:42:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 03:42:01,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:42:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:42:01,033 INFO L225 Difference]: With dead ends: 126 [2024-10-13 03:42:01,033 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 03:42:01,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:42:01,034 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:42:01,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 363 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:42:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 03:42:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 64. [2024-10-13 03:42:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:42:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2024-10-13 03:42:01,053 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 121 [2024-10-13 03:42:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:42:01,056 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2024-10-13 03:42:01,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:42:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2024-10-13 03:42:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:42:01,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:42:01,058 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:42:01,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:42:01,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:42:01,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:42:01,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1371368921, now seen corresponding path program 1 times [2024-10-13 03:42:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:42:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707821683] [2024-10-13 03:42:01,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:42:01,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:42:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:42:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:42:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:42:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:42:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:42:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:42:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:42:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:42:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:42:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:42:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:42:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:42:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:42:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:42:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:42:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:42:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:42:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:42:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:42:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:42:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:42:02,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:42:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707821683] [2024-10-13 03:42:02,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707821683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:42:02,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:42:02,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:42:02,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470675276] [2024-10-13 03:42:02,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:42:02,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:42:02,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:42:02,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:42:02,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:42:02,491 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:42:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:42:02,807 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2024-10-13 03:42:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:42:02,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:42:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:42:02,808 INFO L225 Difference]: With dead ends: 91 [2024-10-13 03:42:02,808 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 03:42:02,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:42:02,809 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 72 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:42:02,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 259 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:42:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 03:42:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2024-10-13 03:42:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:42:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2024-10-13 03:42:02,825 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2024-10-13 03:42:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:42:02,825 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2024-10-13 03:42:02,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:42:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2024-10-13 03:42:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:42:02,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:42:02,826 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:42:02,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:42:02,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:42:02,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:42:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1428567641, now seen corresponding path program 1 times [2024-10-13 03:42:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:42:02,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395446339] [2024-10-13 03:42:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:42:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:42:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:42:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:42:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:42:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:42:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:42:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:42:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:42:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:42:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:42:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:42:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:42:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:42:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:42:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:42:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:42:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:42:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:42:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:42:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:42:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:42:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:42:03,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:42:03,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395446339] [2024-10-13 03:42:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395446339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:42:03,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:42:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:42:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270344680] [2024-10-13 03:42:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:42:03,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:42:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:42:03,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:42:03,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:42:03,862 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:42:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:42:04,119 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-10-13 03:42:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:42:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:42:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:42:04,120 INFO L225 Difference]: With dead ends: 89 [2024-10-13 03:42:04,120 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 03:42:04,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:42:04,122 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 78 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:42:04,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 242 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:42:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 03:42:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 03:42:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 03:42:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 03:42:04,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2024-10-13 03:42:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:42:04,123 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 03:42:04,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:42:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 03:42:04,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 03:42:04,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:42:04,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:42:04,129 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:42:04,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 03:43:15,736 WARN L286 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 240 DAG size of output: 371 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)