./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_has-floats_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-32.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 4ca47567d960d28eb558b95d7dc19a5acbfff015e985881cbaf1273ae96c48df --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:51:10,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:51:10,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:51:10,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:51:10,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:51:11,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:51:11,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:51:11,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:51:11,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:51:11,013 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:51:11,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:51:11,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:51:11,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:51:11,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:51:11,017 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:51:11,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:51:11,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:51:11,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:51:11,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:51:11,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:51:11,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:51:11,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:51:11,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:51:11,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:51:11,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:51:11,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:51:11,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:51:11,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:51:11,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:51:11,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:51:11,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:51:11,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:51:11,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:51:11,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:51:11,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:51:11,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:51:11,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:51:11,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:51:11,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:51:11,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:51:11,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:51:11,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:51:11,029 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 -> 4ca47567d960d28eb558b95d7dc19a5acbfff015e985881cbaf1273ae96c48df [2024-11-20 05:51:11,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:51:11,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:51:11,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:51:11,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:51:11,336 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:51:11,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-32.i [2024-11-20 05:51:12,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:51:13,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:51:13,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-32.i [2024-11-20 05:51:13,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291337f91/b068c2eeffd5463ca909710723d076d6/FLAG7b29a74a7 [2024-11-20 05:51:13,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291337f91/b068c2eeffd5463ca909710723d076d6 [2024-11-20 05:51:13,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:51:13,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:51:13,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:51:13,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:51:13,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:51:13,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa5b835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13, skipping insertion in model container [2024-11-20 05:51:13,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:51:13,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-32.i[917,930] [2024-11-20 05:51:13,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:51:13,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:51:13,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-32.i[917,930] [2024-11-20 05:51:13,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:51:13,381 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:51:13,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13 WrapperNode [2024-11-20 05:51:13,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:51:13,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:51:13,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:51:13,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:51:13,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,451 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-20 05:51:13,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:51:13,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:51:13,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:51:13,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:51:13,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,493 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:51:13,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:51:13,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:51:13,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:51:13,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:51:13,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (1/1) ... [2024-11-20 05:51:13,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:51:13,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:51:13,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:51:13,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:51:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:51:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:51:13,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:51:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:51:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:51:13,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:51:13,670 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:51:13,672 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:51:13,959 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 05:51:13,960 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:51:13,975 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:51:13,976 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:51:13,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:51:13 BoogieIcfgContainer [2024-11-20 05:51:13,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:51:13,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:51:13,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:51:13,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:51:13,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:51:13" (1/3) ... [2024-11-20 05:51:13,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdee107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:51:13, skipping insertion in model container [2024-11-20 05:51:13,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:13" (2/3) ... [2024-11-20 05:51:13,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdee107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:51:13, skipping insertion in model container [2024-11-20 05:51:13,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:51:13" (3/3) ... [2024-11-20 05:51:13,985 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-32.i [2024-11-20 05:51:14,002 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:51:14,003 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:51:14,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:51:14,077 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;@1e99db67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:51:14,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:51:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 05:51:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 05:51:14,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:14,092 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:14,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:14,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash 385929245, now seen corresponding path program 1 times [2024-11-20 05:51:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:14,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430266920] [2024-11-20 05:51:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:14,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430266920] [2024-11-20 05:51:14,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430266920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:14,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:14,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:51:14,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887273542] [2024-11-20 05:51:14,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:14,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:51:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:14,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:51:14,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:51:14,816 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:15,014 INFO L93 Difference]: Finished difference Result 162 states and 287 transitions. [2024-11-20 05:51:15,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:51:15,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-20 05:51:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:15,027 INFO L225 Difference]: With dead ends: 162 [2024-11-20 05:51:15,027 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 05:51:15,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:51:15,033 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 72 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:15,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 206 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:51:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 05:51:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2024-11-20 05:51:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-11-20 05:51:15,119 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 113 [2024-11-20 05:51:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:15,123 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-11-20 05:51:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-11-20 05:51:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 05:51:15,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:15,127 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:15,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:51:15,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:15,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -294129125, now seen corresponding path program 1 times [2024-11-20 05:51:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:15,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273626883] [2024-11-20 05:51:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:19,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:19,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273626883] [2024-11-20 05:51:19,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273626883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:19,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:19,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 05:51:19,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328642804] [2024-11-20 05:51:19,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:19,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 05:51:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:19,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 05:51:19,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:51:19,629 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 05:51:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:21,180 INFO L93 Difference]: Finished difference Result 121 states and 171 transitions. [2024-11-20 05:51:21,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 05:51:21,181 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-20 05:51:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:21,185 INFO L225 Difference]: With dead ends: 121 [2024-11-20 05:51:21,185 INFO L226 Difference]: Without dead ends: 119 [2024-11-20 05:51:21,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-20 05:51:21,187 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 165 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:21,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 380 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 05:51:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-20 05:51:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2024-11-20 05:51:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2024-11-20 05:51:21,214 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 113 [2024-11-20 05:51:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:21,215 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2024-11-20 05:51:21,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 05:51:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2024-11-20 05:51:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 05:51:21,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:21,218 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:21,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:51:21,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:21,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash -933556435, now seen corresponding path program 1 times [2024-11-20 05:51:21,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:21,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354912258] [2024-11-20 05:51:21,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:21,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:23,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354912258] [2024-11-20 05:51:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354912258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 05:51:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765310530] [2024-11-20 05:51:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:23,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 05:51:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 05:51:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:51:23,999 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:25,220 INFO L93 Difference]: Finished difference Result 151 states and 208 transitions. [2024-11-20 05:51:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 05:51:25,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-20 05:51:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:25,225 INFO L225 Difference]: With dead ends: 151 [2024-11-20 05:51:25,226 INFO L226 Difference]: Without dead ends: 149 [2024-11-20 05:51:25,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2024-11-20 05:51:25,228 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 113 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:25,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 399 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:51:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-20 05:51:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 109. [2024-11-20 05:51:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-20 05:51:25,244 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 114 [2024-11-20 05:51:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:25,245 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-20 05:51:25,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-20 05:51:25,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 05:51:25,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:25,247 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:25,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:51:25,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:25,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 36486516, now seen corresponding path program 1 times [2024-11-20 05:51:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:25,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993629634] [2024-11-20 05:51:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993629634] [2024-11-20 05:51:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993629634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:26,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:26,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 05:51:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806875106] [2024-11-20 05:51:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:26,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 05:51:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:26,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 05:51:26,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:51:26,989 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:27,693 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2024-11-20 05:51:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 05:51:27,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-20 05:51:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:27,696 INFO L225 Difference]: With dead ends: 139 [2024-11-20 05:51:27,696 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 05:51:27,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-20 05:51:27,697 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:27,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 385 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:51:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 05:51:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 109. [2024-11-20 05:51:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-20 05:51:27,712 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 114 [2024-11-20 05:51:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:27,714 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-20 05:51:27,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-20 05:51:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 05:51:27,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:27,716 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:27,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:51:27,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:27,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash 886190736, now seen corresponding path program 1 times [2024-11-20 05:51:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:27,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992117554] [2024-11-20 05:51:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:27,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:30,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:30,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992117554] [2024-11-20 05:51:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992117554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:30,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:30,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 05:51:30,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196274705] [2024-11-20 05:51:30,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:30,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 05:51:30,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:30,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 05:51:30,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:51:30,231 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:31,436 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-11-20 05:51:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 05:51:31,437 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-20 05:51:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:31,439 INFO L225 Difference]: With dead ends: 144 [2024-11-20 05:51:31,439 INFO L226 Difference]: Without dead ends: 142 [2024-11-20 05:51:31,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2024-11-20 05:51:31,440 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 113 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:31,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 392 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:51:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-20 05:51:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2024-11-20 05:51:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2024-11-20 05:51:31,458 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 115 [2024-11-20 05:51:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:31,459 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2024-11-20 05:51:31,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2024-11-20 05:51:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 05:51:31,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:31,461 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:31,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:51:31,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:31,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2084428143, now seen corresponding path program 1 times [2024-11-20 05:51:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:31,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505552807] [2024-11-20 05:51:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505552807] [2024-11-20 05:51:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505552807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:32,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 05:51:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48229298] [2024-11-20 05:51:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:32,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 05:51:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 05:51:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-20 05:51:32,494 INFO L87 Difference]: Start difference. First operand 111 states and 165 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:33,355 INFO L93 Difference]: Finished difference Result 298 states and 422 transitions. [2024-11-20 05:51:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 05:51:33,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-20 05:51:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:33,358 INFO L225 Difference]: With dead ends: 298 [2024-11-20 05:51:33,360 INFO L226 Difference]: Without dead ends: 190 [2024-11-20 05:51:33,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2024-11-20 05:51:33,364 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 197 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:33,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 511 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:51:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-20 05:51:33,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 121. [2024-11-20 05:51:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-11-20 05:51:33,388 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 115 [2024-11-20 05:51:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:33,388 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-11-20 05:51:33,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-11-20 05:51:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 05:51:33,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:33,393 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:33,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 05:51:33,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:33,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash -309420781, now seen corresponding path program 1 times [2024-11-20 05:51:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:33,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014461101] [2024-11-20 05:51:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:35,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:35,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014461101] [2024-11-20 05:51:35,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014461101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:35,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:35,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 05:51:35,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662048116] [2024-11-20 05:51:35,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:35,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 05:51:35,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:35,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 05:51:35,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:51:35,396 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:36,331 INFO L93 Difference]: Finished difference Result 167 states and 227 transitions. [2024-11-20 05:51:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 05:51:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-20 05:51:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:36,332 INFO L225 Difference]: With dead ends: 167 [2024-11-20 05:51:36,333 INFO L226 Difference]: Without dead ends: 165 [2024-11-20 05:51:36,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-20 05:51:36,334 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 97 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:36,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 375 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:51:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-20 05:51:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 121. [2024-11-20 05:51:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-11-20 05:51:36,349 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 115 [2024-11-20 05:51:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:36,350 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-11-20 05:51:36,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-11-20 05:51:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 05:51:36,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:36,351 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:36,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:51:36,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:36,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:36,356 INFO L85 PathProgramCache]: Analyzing trace with hash -598251145, now seen corresponding path program 1 times [2024-11-20 05:51:36,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:36,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522493904] [2024-11-20 05:51:36,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:36,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:37,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522493904] [2024-11-20 05:51:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522493904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:37,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 05:51:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753671723] [2024-11-20 05:51:37,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:37,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 05:51:37,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:37,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 05:51:37,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:51:37,446 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:38,625 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2024-11-20 05:51:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 05:51:38,626 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-20 05:51:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:38,627 INFO L225 Difference]: With dead ends: 198 [2024-11-20 05:51:38,628 INFO L226 Difference]: Without dead ends: 196 [2024-11-20 05:51:38,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-20 05:51:38,629 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 179 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:38,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 534 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 05:51:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-20 05:51:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 122. [2024-11-20 05:51:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-11-20 05:51:38,647 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 116 [2024-11-20 05:51:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:38,648 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-11-20 05:51:38,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-11-20 05:51:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 05:51:38,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:38,649 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:38,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 05:51:38,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:38,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1407597771, now seen corresponding path program 1 times [2024-11-20 05:51:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586083225] [2024-11-20 05:51:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:40,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586083225] [2024-11-20 05:51:40,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586083225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:40,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:40,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 05:51:40,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450781360] [2024-11-20 05:51:40,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:40,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 05:51:40,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:40,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 05:51:40,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:51:40,114 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:41,356 INFO L93 Difference]: Finished difference Result 193 states and 258 transitions. [2024-11-20 05:51:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-20 05:51:41,356 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-20 05:51:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:41,358 INFO L225 Difference]: With dead ends: 193 [2024-11-20 05:51:41,358 INFO L226 Difference]: Without dead ends: 191 [2024-11-20 05:51:41,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 05:51:41,359 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 191 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:41,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 502 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:51:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-20 05:51:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 124. [2024-11-20 05:51:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 185 transitions. [2024-11-20 05:51:41,369 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 185 transitions. Word has length 116 [2024-11-20 05:51:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:41,371 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 185 transitions. [2024-11-20 05:51:41,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 185 transitions. [2024-11-20 05:51:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 05:51:41,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:41,372 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:41,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 05:51:41,373 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:41,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1602400120, now seen corresponding path program 1 times [2024-11-20 05:51:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:41,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594700043] [2024-11-20 05:51:41,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 05:51:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594700043] [2024-11-20 05:51:43,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594700043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:43,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 05:51:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196301121] [2024-11-20 05:51:43,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:43,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 05:51:43,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:43,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 05:51:43,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:51:43,233 INFO L87 Difference]: Start difference. First operand 124 states and 185 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:44,147 INFO L93 Difference]: Finished difference Result 167 states and 230 transitions. [2024-11-20 05:51:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 05:51:44,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-20 05:51:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:44,149 INFO L225 Difference]: With dead ends: 167 [2024-11-20 05:51:44,149 INFO L226 Difference]: Without dead ends: 165 [2024-11-20 05:51:44,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2024-11-20 05:51:44,150 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 101 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:44,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 415 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:51:44,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-20 05:51:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2024-11-20 05:51:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 187 transitions. [2024-11-20 05:51:44,159 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 187 transitions. Word has length 117 [2024-11-20 05:51:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:44,160 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 187 transitions. [2024-11-20 05:51:44,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 05:51:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 187 transitions. [2024-11-20 05:51:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-20 05:51:44,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:44,165 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:44,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 05:51:44,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:44,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1723789679, now seen corresponding path program 1 times [2024-11-20 05:51:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026932258] [2024-11-20 05:51:44,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:44,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:51:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:51:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:51:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:51:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:51:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:51:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 05:51:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:51:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:51:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 05:51:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 05:51:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 05:51:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 05:51:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:51:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:51:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-20 05:51:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 05:51:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-20 05:51:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-20 05:51:44,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026932258] [2024-11-20 05:51:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026932258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:51:44,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:51:44,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:51:44,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79208167] [2024-11-20 05:51:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:51:44,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:51:44,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:51:44,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:51:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:51:44,308 INFO L87 Difference]: Start difference. First operand 125 states and 187 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-20 05:51:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:51:44,374 INFO L93 Difference]: Finished difference Result 182 states and 271 transitions. [2024-11-20 05:51:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:51:44,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 224 [2024-11-20 05:51:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:51:44,376 INFO L225 Difference]: With dead ends: 182 [2024-11-20 05:51:44,376 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 05:51:44,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:51:44,377 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:51:44,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 70 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:51:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 05:51:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-20 05:51:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 05:51:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-11-20 05:51:44,389 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 224 [2024-11-20 05:51:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:51:44,392 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-11-20 05:51:44,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-20 05:51:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-11-20 05:51:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-20 05:51:44,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:51:44,395 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:51:44,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 05:51:44,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:51:44,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:51:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1891119247, now seen corresponding path program 1 times [2024-11-20 05:51:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:51:44,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841699879] [2024-11-20 05:51:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:51:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:51:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:51:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:51:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:51:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:51:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:51:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:51:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:51:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:51:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:51:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:51:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:51:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:51:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:51:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:51:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:51:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:51:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:51:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:51:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:51:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:51:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:51:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:51:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:51:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 05:51:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:51:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:51:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 05:51:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 05:51:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 05:51:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 05:51:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:51:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:51:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-20 05:51:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 05:51:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-20 05:51:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2024-11-20 05:51:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:51:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841699879] [2024-11-20 05:51:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841699879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:51:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243650333] [2024-11-20 05:51:46,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:51:46,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:51:46,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:51:46,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:51:46,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:51:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:51:46,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 05:51:46,610 INFO L278 TraceCheckSpWp]: Computing forward predicates...