./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.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 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:39:47,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:39:47,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:39:47,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:39:47,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:39:47,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:39:47,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:39:47,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:39:47,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:39:47,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:39:47,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:39:47,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:39:47,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:39:47,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:39:47,254 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:39:47,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:39:47,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:39:47,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:39:47,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:39:47,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:39:47,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:39:47,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:39:47,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:39:47,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:39:47,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:39:47,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:39:47,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:39:47,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:39:47,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:39:47,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:39:47,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:39:47,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:39:47,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:39:47,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:39:47,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:39:47,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:39:47,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:39:47,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:39:47,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:39:47,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:39:47,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:39:47,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:39:47,265 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 -> 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc [2024-10-13 03:39:47,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:39:47,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:39:47,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:39:47,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:39:47,550 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:39:47,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-13 03:39:49,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:39:49,276 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:39:49,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-13 03:39:49,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855e424ab/5478fc18a1784bfeb9c8246f2eb192f5/FLAGbdc7aa69a [2024-10-13 03:39:49,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855e424ab/5478fc18a1784bfeb9c8246f2eb192f5 [2024-10-13 03:39:49,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:39:49,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:39:49,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:39:49,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:39:49,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:39:49,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:39:49" (1/1) ... [2024-10-13 03:39:49,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56744c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:49, skipping insertion in model container [2024-10-13 03:39:49,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:39:49" (1/1) ... [2024-10-13 03:39:49,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:39:49,888 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-10-13 03:39:49,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:39:49,962 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:39:49,978 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-10-13 03:39:50,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:39:50,026 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:39:50,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50 WrapperNode [2024-10-13 03:39:50,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:39:50,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:39:50,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:39:50,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:39:50,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,085 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-10-13 03:39:50,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:39:50,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:39:50,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:39:50,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:39:50,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:39:50,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:39:50,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:39:50,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:39:50,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:39:50,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (1/1) ... [2024-10-13 03:39:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:39:50,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:39:50,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:39:50,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:39:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:39:50,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:39:50,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:39:50,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:39:50,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:39:50,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:39:50,340 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:39:50,342 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:39:50,666 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 03:39:50,667 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:39:50,709 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:39:50,710 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:39:50,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:39:50 BoogieIcfgContainer [2024-10-13 03:39:50,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:39:50,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:39:50,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:39:50,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:39:50,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:39:49" (1/3) ... [2024-10-13 03:39:50,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767aee04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:39:50, skipping insertion in model container [2024-10-13 03:39:50,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:50" (2/3) ... [2024-10-13 03:39:50,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767aee04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:39:50, skipping insertion in model container [2024-10-13 03:39:50,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:39:50" (3/3) ... [2024-10-13 03:39:50,720 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-13 03:39:50,733 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:39:50,733 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:39:50,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:39:50,790 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;@7f7a6808, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:39:50,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:39:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:39:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 03:39:50,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:50,810 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:39:50,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:50,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash 455106167, now seen corresponding path program 1 times [2024-10-13 03:39:50,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:39:50,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509550594] [2024-10-13 03:39:50,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:50,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:39:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:39:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:39:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:39:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:39:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:39:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:39:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:39:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:39:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:39:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:39:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:39:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:39:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:39:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:39:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:39:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:39:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:39:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:39:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509550594] [2024-10-13 03:39:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509550594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:39:51,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:39:51,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:39:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90312441] [2024-10-13 03:39:51,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:39:51,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:39:51,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:39:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:39:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:39:51,256 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 03:39:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:39:51,300 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-10-13 03:39:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:39:51,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-10-13 03:39:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:39:51,319 INFO L225 Difference]: With dead ends: 113 [2024-10-13 03:39:51,319 INFO L226 Difference]: Without dead ends: 56 [2024-10-13 03:39:51,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:39:51,331 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:39:51,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:39:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-13 03:39:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-13 03:39:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:39:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2024-10-13 03:39:51,399 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 103 [2024-10-13 03:39:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:39:51,400 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2024-10-13 03:39:51,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 03:39:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2024-10-13 03:39:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 03:39:51,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:51,409 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:39:51,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:39:51,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 885472887, now seen corresponding path program 1 times [2024-10-13 03:39:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:39:51,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489290265] [2024-10-13 03:39:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:51,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:39:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:39:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:39:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:39:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:39:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:39:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:39:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:39:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:39:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:39:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:39:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:39:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:39:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:39:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:39:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:39:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:39:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:39:51,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:39:51,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489290265] [2024-10-13 03:39:51,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489290265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:39:51,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:39:51,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:39:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286369076] [2024-10-13 03:39:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:39:51,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:39:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:39:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:39:51,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:39:51,697 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:39:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:39:51,765 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2024-10-13 03:39:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:39:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-10-13 03:39:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:39:51,767 INFO L225 Difference]: With dead ends: 111 [2024-10-13 03:39:51,767 INFO L226 Difference]: Without dead ends: 56 [2024-10-13 03:39:51,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:39:51,770 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:39:51,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:39:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-13 03:39:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-13 03:39:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:39:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-10-13 03:39:51,786 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 103 [2024-10-13 03:39:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:39:51,788 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-10-13 03:39:51,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:39:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-10-13 03:39:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:39:51,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:51,792 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:39:51,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:39:51,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:51,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1922342594, now seen corresponding path program 1 times [2024-10-13 03:39:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:39:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365642391] [2024-10-13 03:39:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:39:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:39:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:39:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:39:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:39:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:39:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:39:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:39:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:39:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:39:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:39:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:39:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:39:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:39:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:39:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:39:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:39:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:39:52,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:39:52,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365642391] [2024-10-13 03:39:52,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365642391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:39:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:39:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:39:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382240465] [2024-10-13 03:39:52,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:39:52,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:39:52,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:39:52,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:39:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:39:52,796 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:39:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:39:53,099 INFO L93 Difference]: Finished difference Result 183 states and 255 transitions. [2024-10-13 03:39:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:39:53,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-13 03:39:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:39:53,103 INFO L225 Difference]: With dead ends: 183 [2024-10-13 03:39:53,105 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 03:39:53,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:39:53,107 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 114 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:39:53,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 240 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:39:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 03:39:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2024-10-13 03:39:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:39:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-10-13 03:39:53,123 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 105 [2024-10-13 03:39:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:39:53,124 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-10-13 03:39:53,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:39:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-10-13 03:39:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:39:53,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:53,127 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:39:53,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:39:53,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:53,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1563278076, now seen corresponding path program 1 times [2024-10-13 03:39:53,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:39:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966866963] [2024-10-13 03:39:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:39:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:39:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:39:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:39:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:39:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:39:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:39:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:39:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:39:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:39:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:39:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:39:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:39:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:39:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:39:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:39:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:39:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:39:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:39:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966866963] [2024-10-13 03:39:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966866963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:39:53,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:39:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:39:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879556956] [2024-10-13 03:39:53,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:39:53,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:39:53,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:39:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:39:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:39:53,373 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:39:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:39:53,429 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-10-13 03:39:53,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:39:53,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-13 03:39:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:39:53,433 INFO L225 Difference]: With dead ends: 185 [2024-10-13 03:39:53,433 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 03:39:53,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:39:53,435 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:39:53,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:39:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 03:39:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 03:39:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:39:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2024-10-13 03:39:53,447 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 105 [2024-10-13 03:39:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:39:53,448 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2024-10-13 03:39:53,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:39:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-10-13 03:39:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:39:53,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:53,450 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:39:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:39:53,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:53,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1620536378, now seen corresponding path program 1 times [2024-10-13 03:39:53,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:39:53,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30215948] [2024-10-13 03:39:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:53,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:39:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:39:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:39:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:39:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:39:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:39:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:39:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:39:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:39:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:39:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:39:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:39:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:39:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:39:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:39:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:39:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:39:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:39:54,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:39:54,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30215948] [2024-10-13 03:39:54,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30215948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:39:54,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:39:54,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:39:54,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359645123] [2024-10-13 03:39:54,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:39:54,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:39:54,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:39:54,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:39:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:39:54,665 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:39:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:39:54,885 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2024-10-13 03:39:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:39:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-13 03:39:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:39:54,889 INFO L225 Difference]: With dead ends: 208 [2024-10-13 03:39:54,889 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 03:39:54,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:39:54,891 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 70 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:39:54,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 165 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:39:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 03:39:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2024-10-13 03:39:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 80 states have internal predecessors, (101), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:39:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2024-10-13 03:39:54,919 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 105 [2024-10-13 03:39:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:39:54,919 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2024-10-13 03:39:54,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:39:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2024-10-13 03:39:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:39:54,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:54,925 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:39:54,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:39:54,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:54,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1418765754, now seen corresponding path program 1 times [2024-10-13 03:39:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:39:54,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663848213] [2024-10-13 03:39:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:54,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:39:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:39:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:39:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:39:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:39:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:39:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:39:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:39:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:39:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:39:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:39:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:39:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:39:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:39:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:39:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:39:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:39:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:39:59,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:39:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663848213] [2024-10-13 03:39:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663848213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:39:59,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:39:59,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 03:39:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998884731] [2024-10-13 03:39:59,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:39:59,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 03:39:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:39:59,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 03:39:59,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:39:59,036 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:00,745 INFO L93 Difference]: Finished difference Result 234 states and 315 transitions. [2024-10-13 03:40:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:40:00,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-13 03:40:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:00,748 INFO L225 Difference]: With dead ends: 234 [2024-10-13 03:40:00,748 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 03:40:00,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:40:00,750 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 114 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:00,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 368 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:40:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 03:40:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2024-10-13 03:40:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 82 states have internal predecessors, (104), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:40:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2024-10-13 03:40:00,772 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 105 [2024-10-13 03:40:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:00,775 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2024-10-13 03:40:00,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2024-10-13 03:40:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:40:00,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:00,777 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:00,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:40:00,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:00,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash 609419128, now seen corresponding path program 1 times [2024-10-13 03:40:00,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:00,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360828509] [2024-10-13 03:40:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:01,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:01,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360828509] [2024-10-13 03:40:01,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360828509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:01,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:01,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:40:01,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641303189] [2024-10-13 03:40:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:01,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:40:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:01,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:40:01,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:40:01,727 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:01,913 INFO L93 Difference]: Finished difference Result 220 states and 299 transitions. [2024-10-13 03:40:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:40:01,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-13 03:40:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:01,917 INFO L225 Difference]: With dead ends: 220 [2024-10-13 03:40:01,917 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 03:40:01,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:40:01,918 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 44 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:01,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 202 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:40:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 03:40:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2024-10-13 03:40:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 73 states have internal predecessors, (92), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:40:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2024-10-13 03:40:01,934 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 105 [2024-10-13 03:40:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:01,935 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2024-10-13 03:40:01,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2024-10-13 03:40:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:40:01,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:01,936 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:01,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:40:01,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:01,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1150019326, now seen corresponding path program 1 times [2024-10-13 03:40:01,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620798052] [2024-10-13 03:40:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:02,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:02,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620798052] [2024-10-13 03:40:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620798052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:02,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:40:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077174327] [2024-10-13 03:40:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:02,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:40:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:40:02,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:02,015 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:02,042 INFO L93 Difference]: Finished difference Result 188 states and 257 transitions. [2024-10-13 03:40:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:40:02,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-13 03:40:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:02,046 INFO L225 Difference]: With dead ends: 188 [2024-10-13 03:40:02,046 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 03:40:02,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:02,047 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:02,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 171 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 03:40:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-10-13 03:40:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 73 states have internal predecessors, (91), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:40:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2024-10-13 03:40:02,058 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 105 [2024-10-13 03:40:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:02,058 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2024-10-13 03:40:02,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2024-10-13 03:40:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:40:02,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:02,060 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:02,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:40:02,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:02,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:02,061 INFO L85 PathProgramCache]: Analyzing trace with hash 138902076, now seen corresponding path program 1 times [2024-10-13 03:40:02,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:02,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890474597] [2024-10-13 03:40:02,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:02,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:02,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890474597] [2024-10-13 03:40:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890474597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:40:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063756706] [2024-10-13 03:40:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:40:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:40:02,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:40:02,218 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:02,259 INFO L93 Difference]: Finished difference Result 188 states and 255 transitions. [2024-10-13 03:40:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:40:02,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-13 03:40:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:02,261 INFO L225 Difference]: With dead ends: 188 [2024-10-13 03:40:02,261 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 03:40:02,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-10-13 03:40:02,262 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 22 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:02,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 272 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 03:40:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-10-13 03:40:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:40:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2024-10-13 03:40:02,276 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 105 [2024-10-13 03:40:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:02,276 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2024-10-13 03:40:02,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2024-10-13 03:40:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 03:40:02,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:02,281 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:02,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:40:02,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:02,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash -425958218, now seen corresponding path program 1 times [2024-10-13 03:40:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722457390] [2024-10-13 03:40:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722457390] [2024-10-13 03:40:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722457390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:02,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:40:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950256029] [2024-10-13 03:40:02,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:02,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:40:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:40:02,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:02,358 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:02,399 INFO L93 Difference]: Finished difference Result 185 states and 251 transitions. [2024-10-13 03:40:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:40:02,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-13 03:40:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:02,401 INFO L225 Difference]: With dead ends: 185 [2024-10-13 03:40:02,401 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 03:40:02,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:02,402 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:02,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 03:40:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 03:40:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 73 states have internal predecessors, (88), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:40:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2024-10-13 03:40:02,415 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 108 [2024-10-13 03:40:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:02,415 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2024-10-13 03:40:02,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2024-10-13 03:40:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 03:40:02,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:02,417 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:02,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:40:02,417 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:02,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash 183947901, now seen corresponding path program 1 times [2024-10-13 03:40:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643436913] [2024-10-13 03:40:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:03,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643436913] [2024-10-13 03:40:03,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643436913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:03,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:03,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 03:40:03,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934594773] [2024-10-13 03:40:03,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:03,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 03:40:03,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:03,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 03:40:03,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:40:03,292 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:04,022 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2024-10-13 03:40:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 03:40:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-13 03:40:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:04,025 INFO L225 Difference]: With dead ends: 209 [2024-10-13 03:40:04,025 INFO L226 Difference]: Without dead ends: 207 [2024-10-13 03:40:04,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:40:04,027 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 258 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:04,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 313 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:40:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-13 03:40:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 136. [2024-10-13 03:40:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.198019801980198) internal successors, (121), 103 states have internal predecessors, (121), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:40:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2024-10-13 03:40:04,044 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 110 [2024-10-13 03:40:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:04,044 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2024-10-13 03:40:04,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2024-10-13 03:40:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 03:40:04,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:04,046 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:04,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 03:40:04,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:04,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash -918189827, now seen corresponding path program 1 times [2024-10-13 03:40:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:04,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845644129] [2024-10-13 03:40:04,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845644129] [2024-10-13 03:40:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845644129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:05,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 03:40:05,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885997444] [2024-10-13 03:40:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:05,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 03:40:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:05,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 03:40:05,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:40:05,338 INFO L87 Difference]: Start difference. First operand 136 states and 181 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:07,030 INFO L93 Difference]: Finished difference Result 215 states and 278 transitions. [2024-10-13 03:40:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 03:40:07,030 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-13 03:40:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:07,032 INFO L225 Difference]: With dead ends: 215 [2024-10-13 03:40:07,032 INFO L226 Difference]: Without dead ends: 213 [2024-10-13 03:40:07,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2024-10-13 03:40:07,033 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 197 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:07,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 541 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 03:40:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-13 03:40:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 178. [2024-10-13 03:40:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 129 states have (on average 1.178294573643411) internal successors, (152), 132 states have internal predecessors, (152), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 03:40:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 236 transitions. [2024-10-13 03:40:07,058 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 236 transitions. Word has length 110 [2024-10-13 03:40:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:07,060 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 236 transitions. [2024-10-13 03:40:07,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 236 transitions. [2024-10-13 03:40:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 03:40:07,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:07,061 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:07,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 03:40:07,062 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:07,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1504995841, now seen corresponding path program 1 times [2024-10-13 03:40:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:07,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088095874] [2024-10-13 03:40:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:07,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:07,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088095874] [2024-10-13 03:40:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088095874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:07,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 03:40:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105013683] [2024-10-13 03:40:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:07,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 03:40:07,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 03:40:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:40:07,765 INFO L87 Difference]: Start difference. First operand 178 states and 236 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:08,345 INFO L93 Difference]: Finished difference Result 244 states and 314 transitions. [2024-10-13 03:40:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 03:40:08,345 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-13 03:40:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:08,347 INFO L225 Difference]: With dead ends: 244 [2024-10-13 03:40:08,347 INFO L226 Difference]: Without dead ends: 242 [2024-10-13 03:40:08,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-10-13 03:40:08,348 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 116 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:08,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 507 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 03:40:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-13 03:40:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 185. [2024-10-13 03:40:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.1911764705882353) internal successors, (162), 139 states have internal predecessors, (162), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 03:40:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2024-10-13 03:40:08,372 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 110 [2024-10-13 03:40:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:08,372 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2024-10-13 03:40:08,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2024-10-13 03:40:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 03:40:08,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:08,374 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:08,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 03:40:08,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:08,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1735838277, now seen corresponding path program 1 times [2024-10-13 03:40:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:08,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195111092] [2024-10-13 03:40:08,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:08,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:09,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:09,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195111092] [2024-10-13 03:40:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195111092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 03:40:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121484317] [2024-10-13 03:40:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:09,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 03:40:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:09,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 03:40:09,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:40:09,140 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:09,598 INFO L93 Difference]: Finished difference Result 212 states and 277 transitions. [2024-10-13 03:40:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 03:40:09,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-13 03:40:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:09,600 INFO L225 Difference]: With dead ends: 212 [2024-10-13 03:40:09,600 INFO L226 Difference]: Without dead ends: 210 [2024-10-13 03:40:09,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-10-13 03:40:09,600 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 105 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:09,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 394 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:40:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-13 03:40:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2024-10-13 03:40:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 147 states have (on average 1.1972789115646258) internal successors, (176), 150 states have internal predecessors, (176), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 03:40:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 260 transitions. [2024-10-13 03:40:09,624 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 260 transitions. Word has length 110 [2024-10-13 03:40:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:09,624 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 260 transitions. [2024-10-13 03:40:09,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 260 transitions. [2024-10-13 03:40:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 03:40:09,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:09,626 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:09,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 03:40:09,626 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:09,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1173674330, now seen corresponding path program 1 times [2024-10-13 03:40:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057395172] [2024-10-13 03:40:09,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:09,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:09,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057395172] [2024-10-13 03:40:09,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057395172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:09,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:09,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:40:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567048765] [2024-10-13 03:40:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:09,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:40:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:40:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:09,684 INFO L87 Difference]: Start difference. First operand 196 states and 260 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:09,758 INFO L93 Difference]: Finished difference Result 418 states and 550 transitions. [2024-10-13 03:40:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:40:09,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-13 03:40:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:09,760 INFO L225 Difference]: With dead ends: 418 [2024-10-13 03:40:09,760 INFO L226 Difference]: Without dead ends: 245 [2024-10-13 03:40:09,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:09,761 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 52 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:09,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-13 03:40:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 222. [2024-10-13 03:40:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 154 states have (on average 1.1233766233766234) internal successors, (173), 158 states have internal predecessors, (173), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 03:40:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 289 transitions. [2024-10-13 03:40:09,795 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 289 transitions. Word has length 111 [2024-10-13 03:40:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:09,796 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 289 transitions. [2024-10-13 03:40:09,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2024-10-13 03:40:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 03:40:09,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:09,798 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:09,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 03:40:09,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:09,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash -261027071, now seen corresponding path program 1 times [2024-10-13 03:40:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371291760] [2024-10-13 03:40:09,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:09,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:40:09,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:09,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371291760] [2024-10-13 03:40:09,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371291760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:09,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:09,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:40:09,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578581497] [2024-10-13 03:40:09,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:09,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:40:09,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:09,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:40:09,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:09,871 INFO L87 Difference]: Start difference. First operand 222 states and 289 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:09,933 INFO L93 Difference]: Finished difference Result 406 states and 525 transitions. [2024-10-13 03:40:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:40:09,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-13 03:40:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:09,936 INFO L225 Difference]: With dead ends: 406 [2024-10-13 03:40:09,936 INFO L226 Difference]: Without dead ends: 207 [2024-10-13 03:40:09,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:09,937 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 56 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:09,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 124 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-13 03:40:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 145. [2024-10-13 03:40:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 93 states have (on average 1.075268817204301) internal successors, (100), 95 states have internal predecessors, (100), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:40:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2024-10-13 03:40:09,961 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 112 [2024-10-13 03:40:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:09,962 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2024-10-13 03:40:09,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2024-10-13 03:40:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 03:40:09,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:09,963 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:09,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 03:40:09,963 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:09,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash 640628027, now seen corresponding path program 1 times [2024-10-13 03:40:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:09,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404594061] [2024-10-13 03:40:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-13 03:40:10,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:10,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404594061] [2024-10-13 03:40:10,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404594061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:40:10,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627336852] [2024-10-13 03:40:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:10,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:40:10,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:40:10,162 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-10-13 03:40:10,163 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-10-13 03:40:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:10,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 03:40:10,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:40:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-10-13 03:40:10,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:40:10,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627336852] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:40:10,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:40:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-10-13 03:40:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556929267] [2024-10-13 03:40:10,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:40:10,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:40:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:10,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:40:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:40:10,778 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 03:40:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:11,158 INFO L93 Difference]: Finished difference Result 343 states and 419 transitions. [2024-10-13 03:40:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 03:40:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 114 [2024-10-13 03:40:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:11,160 INFO L225 Difference]: With dead ends: 343 [2024-10-13 03:40:11,160 INFO L226 Difference]: Without dead ends: 221 [2024-10-13 03:40:11,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:40:11,162 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 73 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:11,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 105 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:40:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-13 03:40:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 150. [2024-10-13 03:40:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 97 states have internal predecessors, (100), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:40:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2024-10-13 03:40:11,194 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 114 [2024-10-13 03:40:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:11,194 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2024-10-13 03:40:11,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 03:40:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2024-10-13 03:40:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 03:40:11,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:11,195 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:11,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 03:40:11,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 03:40:11,400 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:11,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1164810307, now seen corresponding path program 1 times [2024-10-13 03:40:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766556524] [2024-10-13 03:40:11,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:40:11,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:40:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:40:11,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:40:11,487 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:40:11,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:40:11,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 03:40:11,494 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:11,590 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:40:11,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:40:11 BoogieIcfgContainer [2024-10-13 03:40:11,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:40:11,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:40:11,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:40:11,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:40:11,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:39:50" (3/4) ... [2024-10-13 03:40:11,597 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:40:11,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:40:11,599 INFO L158 Benchmark]: Toolchain (without parser) took 21920.75ms. Allocated memory was 155.2MB in the beginning and 434.1MB in the end (delta: 278.9MB). Free memory was 83.1MB in the beginning and 317.8MB in the end (delta: -234.7MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-10-13 03:40:11,599 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:40:11,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.70ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 68.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:40:11,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.38ms. Allocated memory is still 155.2MB. Free memory was 68.7MB in the beginning and 65.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:40:11,600 INFO L158 Benchmark]: Boogie Preprocessor took 65.54ms. Allocated memory is still 155.2MB. Free memory was 65.7MB in the beginning and 62.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:40:11,600 INFO L158 Benchmark]: RCFGBuilder took 558.53ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 61.9MB in the beginning and 162.3MB in the end (delta: -100.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-13 03:40:11,600 INFO L158 Benchmark]: TraceAbstraction took 20880.96ms. Allocated memory was 207.6MB in the beginning and 434.1MB in the end (delta: 226.5MB). Free memory was 162.3MB in the beginning and 317.8MB in the end (delta: -155.5MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-10-13 03:40:11,600 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 434.1MB. Free memory is still 317.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:40:11,602 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.70ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 68.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.38ms. Allocated memory is still 155.2MB. Free memory was 68.7MB in the beginning and 65.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.54ms. Allocated memory is still 155.2MB. Free memory was 65.7MB in the beginning and 62.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 558.53ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 61.9MB in the beginning and 162.3MB in the end (delta: -100.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20880.96ms. Allocated memory was 207.6MB in the beginning and 434.1MB in the end (delta: 226.5MB). Free memory was 162.3MB in the beginning and 317.8MB in the end (delta: -155.5MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 434.1MB. Free memory is still 317.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] signed long int var_1_8 = 8; [L28] signed long int var_1_9 = 255; [L29] signed long int var_1_10 = 10000000; [L30] signed long int var_1_11 = 0; [L31] signed long int var_1_12 = 255; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L67] var_1_9 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L70] var_1_10 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L73] var_1_11 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L76] var_1_12 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L79] var_1_14 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L80] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L81] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L82] var_1_16 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L83] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L84] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L97] RET updateVariables() [L98] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] COND TRUE stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)))) [L49] var_1_7 = (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=8, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_1=254, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=8, var_1_9=0] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89-L90] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((signed long int) (var_1_9 - var_1_10))) : (var_1_8 == ((signed long int) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.7s, OverallIterations: 18, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1257 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1253 mSDsluCounter, 4025 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2691 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3712 IncrementalHoareTripleChecker+Invalid, 3780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 1334 mSDtfsCounter, 3712 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 871 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=15, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 449 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 2054 NumberOfCodeBlocks, 2054 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1922 ConstructedInterpolants, 0 QuantifiedInterpolants, 8026 SizeOfPredicates, 2 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 8568/8640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:40:11,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:40:13,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:40:13,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:40:13,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:40:13,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:40:13,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:40:13,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:40:13,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:40:13,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:40:13,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:40:13,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:40:13,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:40:13,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:40:13,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:40:13,980 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:40:13,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:40:13,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:40:13,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:40:13,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:40:13,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:40:13,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:40:13,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:40:13,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:40:13,986 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:40:13,986 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:40:13,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:40:13,987 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:40:13,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:40:13,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:40:13,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:40:13,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:40:13,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:40:13,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:40:13,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:40:13,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:40:13,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:40:13,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:40:13,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:40:13,991 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:40:13,991 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:40:13,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:40:13,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:40:13,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:40:13,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:40:13,993 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:40:13,993 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 -> 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc [2024-10-13 03:40:14,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:40:14,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:40:14,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:40:14,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:40:14,371 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:40:14,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-13 03:40:15,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:40:16,157 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:40:16,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-13 03:40:16,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f166ee131/f5b90796c402404aac678a4b9a9b7aea/FLAGfb9a40f24 [2024-10-13 03:40:16,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f166ee131/f5b90796c402404aac678a4b9a9b7aea [2024-10-13 03:40:16,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:40:16,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:40:16,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:40:16,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:40:16,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:40:16,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4bd861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16, skipping insertion in model container [2024-10-13 03:40:16,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:40:16,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-10-13 03:40:16,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:40:16,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:40:16,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-10-13 03:40:16,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:40:16,859 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:40:16,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16 WrapperNode [2024-10-13 03:40:16,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:40:16,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:40:16,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:40:16,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:40:16,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,912 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-10-13 03:40:16,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:40:16,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:40:16,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:40:16,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:40:16,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,940 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:40:16,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:40:16,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:40:16,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:40:16,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:40:16,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (1/1) ... [2024-10-13 03:40:16,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:40:16,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:40:17,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:40:17,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:40:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:40:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:40:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:40:17,053 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:40:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:40:17,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:40:17,140 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:40:17,142 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:40:17,418 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:40:17,419 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:40:17,460 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:40:17,460 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:40:17,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:40:17 BoogieIcfgContainer [2024-10-13 03:40:17,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:40:17,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:40:17,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:40:17,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:40:17,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:40:16" (1/3) ... [2024-10-13 03:40:17,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952b624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:40:17, skipping insertion in model container [2024-10-13 03:40:17,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:16" (2/3) ... [2024-10-13 03:40:17,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952b624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:40:17, skipping insertion in model container [2024-10-13 03:40:17,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:40:17" (3/3) ... [2024-10-13 03:40:17,474 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-13 03:40:17,491 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:40:17,491 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:40:17,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:40:17,573 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;@6c386890, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:40:17,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:40:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:40:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 03:40:17,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:17,589 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:17,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:17,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash 597887913, now seen corresponding path program 1 times [2024-10-13 03:40:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:40:17,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816628066] [2024-10-13 03:40:17,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:17,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:40:17,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:40:17,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:40:17,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:40:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:17,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:40:17,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:40:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-13 03:40:17,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:40:17,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:40:17,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816628066] [2024-10-13 03:40:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816628066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:17,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:40:17,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71531216] [2024-10-13 03:40:17,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:40:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:40:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:40:17,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:40:17,872 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:17,916 INFO L93 Difference]: Finished difference Result 83 states and 144 transitions. [2024-10-13 03:40:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:40:17,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-13 03:40:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:17,929 INFO L225 Difference]: With dead ends: 83 [2024-10-13 03:40:17,929 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 03:40:17,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:40:17,937 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:17,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 03:40:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 03:40:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:40:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-13 03:40:17,977 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 99 [2024-10-13 03:40:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:17,978 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-13 03:40:17,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:40:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-13 03:40:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 03:40:17,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:17,982 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:17,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 03:40:18,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:40:18,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:18,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash -474354775, now seen corresponding path program 1 times [2024-10-13 03:40:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:40:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976308347] [2024-10-13 03:40:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:18,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:40:18,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:40:18,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:40:18,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:40:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:18,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 03:40:18,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:40:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 138 proven. 72 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-13 03:40:18,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:40:19,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:40:19,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976308347] [2024-10-13 03:40:19,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976308347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:40:19,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [829487149] [2024-10-13 03:40:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:19,227 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:40:19,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:40:19,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:40:19,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 03:40:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:19,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 03:40:19,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:40:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 138 proven. 72 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-13 03:40:19,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:40:19,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [829487149] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:40:19,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:40:19,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-13 03:40:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939818982] [2024-10-13 03:40:19,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:40:19,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:40:19,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:40:19,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:40:19,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:40:19,888 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-13 03:40:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:20,397 INFO L93 Difference]: Finished difference Result 111 states and 151 transitions. [2024-10-13 03:40:20,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 03:40:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 99 [2024-10-13 03:40:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:20,400 INFO L225 Difference]: With dead ends: 111 [2024-10-13 03:40:20,401 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 03:40:20,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-10-13 03:40:20,405 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 66 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:20,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 80 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:40:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 03:40:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2024-10-13 03:40:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:40:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2024-10-13 03:40:20,423 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 99 [2024-10-13 03:40:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:20,425 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2024-10-13 03:40:20,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-13 03:40:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2024-10-13 03:40:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 03:40:20,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:20,432 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:40:20,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-13 03:40:20,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 03:40:20,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:40:20,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1283701401, now seen corresponding path program 1 times [2024-10-13 03:40:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:40:20,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922235014] [2024-10-13 03:40:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:20,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:40:20,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:40:20,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:40:20,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 03:40:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:20,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 03:40:20,953 INFO L278 TraceCheckSpWp]: Computing forward predicates...